Abstract
The arc-searching problem is a natural extension of the edge searching problem, which is to determine the minimum number of searchers (search number) needed to capture an invisible fast intruder in a graph. We examine several models for the internal arc-searching problem, in which the searchers may not "jump" from a vertex to a non-adjacent vertex. We will explore some elementary results and characterize directed graphs with small search number for the various models. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Alspach, B., Dyer, D., Hanson, D., & Yang, B. (2007). Arc searching digraphs without jumping. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4616 LNCS, pp. 354–365). Springer Verlag. https://doi.org/10.1007/978-3-540-73556-4_37
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
