Abstract
We consider a new pursuit-evasion problem on trees where a subset of vertices, called sources, are initially occupied by searchers. We also consider the scenario where some of the searchers must end their search at certain vertices called targets. We incrementally consider such problems, first considering only sources, then only targets, and finally we consider the case where there are both sources and targets. For each case we provide a polynomial-time algorithm for computing the search number, i.e. the minimum number of searchers required to clear the tree, and an optimal search strategy. We also demonstrate that each search model is monotonic, i.e. for each case their exists an optimal search strategy such that the set of cleared edges grows monotonically as the search progresses.
Research was supported in part by NSERC.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Dendris, N., Kirousis, L., Thilikos, D.: Fugitive-search games on graphs and related parameters. Theoretical Computer Science 172, 233–254 (1997)
Fomin, F., Petrov, N.: Pursuit-evasion and search problems on graphs. Congressus Numerantium 122, 47–58 (1996)
LaPaugh, A.: Recontamination does not help to search a graph. Journal of ACM 40, 224–245 (1993)
Megiddo, N., Hakimi, S., Garey, M., Johnson, D., Papadimitriou, C.: The complexity of searching a graph. Journal of ACM 35, 18–44 (1998)
Parsons, T.: Pursuit-evasion in a graph. In: Theory and Applications of Graphs. Lecture Notes in Mathematics, pp. 426–441. Springer, Heidelberg (1976)
Peng, S., Ho, C., Hsu, T., Ko, M., Tang, C.: Edge and Node Searching Problems on Trees. Theoretical Computer Science 240, 429–446 (2000)
Yang, B., Zhang, R., Cao, Y.: Searching Cycle-Disjoint Graphs. In: Dress, A.W.M., Xu, Y., Zhu, B. (eds.) COCOA 2007. LNCS, vol. 4616, pp. 32–43. Springer, Heidelberg (2007)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Worman, C., Yang, B. (2008). Searching Trees with Sources and Targets. In: Preparata, F.P., Wu, X., Yin, J. (eds) Frontiers in Algorithmics. FAW 2008. Lecture Notes in Computer Science, vol 5059. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69311-6_20
Download citation
DOI: https://doi.org/10.1007/978-3-540-69311-6_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69310-9
Online ISBN: 978-3-540-69311-6
eBook Packages: Computer ScienceComputer Science (R0)