Abstract
Given a digraph, suppose that some intruders hide on vertices or along edges of the digraph. We want to find the minimum number of searchers required to capture all the intruders hiding in the digraph. In this paper, we propose and study two digraph searching models: strong searching and mixed strong searching. In these two search models, searchers can move either from tail to head or from head to tail when they slide along edges, but intruders must follow the edge directions when they move along edges. We prove the monotonicity of each model respectively, and show that both searching problems are NP-complete.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alspach, B., Dyer, D., Hanson, D., Yang, B.: Some basic results in arc searching. Technical report CS-2006-10, University of Regina (2006)
Barat, J.: Directed path-width and monotonicity in digraph searching. Graphs and Combinatorics 22, 161–172 (2006)
Bienstock, D., Seymour, P.: Monotonicity in graph searching. Journal of Algorithms 12, 239–245 (1991)
Fomin, F., Thilikos, D.: On the monotonicity of games generated by symmetric submodular functions. Discrete Applied Mathematics 131, 323–335 (2003)
Johnson, T., Robertson, N., Seymour, P., Thomas, R.: Directed tree-width. Journal of Combinatorial Theory, Series B 82, 138–154 (2001)
Kirousis, L., Papadimitriou, C.: Searching and pebbling. Theoret. Comput. Sci. 47, 205–218 (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)
Yang, B., Cao, Y.: Monotonicity of Digraph Directed Searching. Preprint (2006)
Yang, B., Cao, Y.: Digraph searching, directed vertex separation and directed pathwidth. Preprint (2006)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Yang, B., Cao, Y. (2007). Digraph Strong Searching: Monotonicity and Complexity. In: Kao, MY., Li, XY. (eds) Algorithmic Aspects in Information and Management. AAIM 2007. Lecture Notes in Computer Science, vol 4508. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72870-2_4
Download citation
DOI: https://doi.org/10.1007/978-3-540-72870-2_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72868-9
Online ISBN: 978-3-540-72870-2
eBook Packages: Computer ScienceComputer Science (R0)