In this paper, we study the problem of computing the minimum number of searchers who can capture an intruder hiding in a graph. We propose a linear time algorithm for computing the vertex separation and the optimal layout for a unicyclic graph. The best algorithm known so far is given by Ellis et al. (2004) and needs O(n log n) time, where n is the number of vertices in the graph. By a linear-time transformation, we can compute the search number and the optimal search strategy for a unicyclic graph in linear time. We show how to compute the search number for a k-ary cycle-disjoint graph. We also present some results on approximation algorithms. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Yang, B., Zhang, R., & Cao, Y. (2007). Searching cycle-disjoint graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4616 LNCS, pp. 32–43). Springer Verlag. https://doi.org/10.1007/978-3-540-73556-4_6
Mendeley helps you to discover research relevant for your work.