Given a graph, suppose that intruders hide on vertices or along edges of the graph. The fast searching problem is to find the minimum number of searchers required to capture all intruders satisfying the constraint that every edge is traversed exactly once and searchers are not allowed to jump. In this paper, we prove lower bounds on the fast search number. We present a linear time algorithm to compute the fast search number of Halin graphs and their extensions. We present a quadratic time algorithm to compute the fast search number of cubic graphs. © 2009 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Stanley, D., & Yang, B. (2009). Lower bounds on fast searching. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5878 LNCS, pp. 964–973). https://doi.org/10.1007/978-3-642-10631-6_97
Mendeley helps you to discover research relevant for your work.