Abstract
The goal of a fugitive-search game on a graph is to trap a fugitive that hides on the vertices of the graph by systematically placing searchers on the vertices. The fugitive is assumed to have complete knowledge of the graph and of the searchers' moves, but is restricted to move only along paths whose vertices are not guarded by searchers. The search number of the graph is the least number of searchers necessary to trap the fugitive. Variants of the fugitive-search game have been related to important graph parameters like treewidth and pathwidth. In this paper, we introduce a class of fugitive-search games where the searchers do not see the fugitive and the fugitive can only move just before a searcher is placed on the vertex it occupies. Letting the fugitive's speed (i.e. the maximum number of edges the fugitive can traverse at a single move) vary, we get different games. We show that if the speed of the fugitive is unbounded then the search number minus 1 is equal to the treewidth of the graph, while if the speed is 1 then the search number minus 1 is equal to the width, a polynomially computable graph parameter. We also show that in the above two cases, the search number remains the same even if we consider only these search strategies that at every step further restrict the fugitive's possible resorts (this monotonicity phenomenon is usually expressed as: “recontamination does not help”). Finally, we show that for any graph, if the length of any chordless cycle is bounded by a constant s (s≥3), then the treewidth of the graph plus 1 is equal to the search number for fugitive speed s−2.
This research was partially supported by the European Union ESPRIT Basic Research Projects ALCOM II (contract no. 7141), GEPPCOM (contract no. 9072) and Insight II (contract no. 6019).
Preview
Unable to display preview. Download preview PDF.
References
S. Arnborg: Efficient algorithms for combinatorial problems on graphs with bounded decomposability (A survey). BIT 25 (1985) 2–33
R. Anderson and E. Mayr: Parallelism and greedy algorithms. Advances in Computing Recearch 4 (1987) 17–38. See also: A P-complete problem and approximations to it. Technical Report, Dept. Computer Science, Stanford University, California (1984)
D. Bienstock: Graph searching, path-width, tree-width and related problems (A survey). DIMACS Series in Discrete Mathematics and Theoretical Computer Science 5 (1991) 33–49
D. Bienstock and P.D. Seymour: Monotonicity in graph searching. Journal of Algorithms 12 (1991) 239–245
H.L. Bodlaender: A tourist guide through treewidth. Acta Cyberbetica 11 (1993) 1–23
H.L. Bodlaender and R.H. Möhring: The pathwidth and treewidth of cographs. SIAM Journal on Discrete Mathematics 6 (1993) 181–188
R. Breisch: An intuitive approach to speleotopology. Southwestern Cavers (A publication of the Southwestern Region of the National Speleological Society) VI (1967) 72–78
R. Dechter: Constraint networks. In: S.C. Shapiro (ed.) Encyclopedia of Artificial Inteligence, Wiley, N.Y. (1992) 285–293
R. Dechter: Directional resolution: The Davis-Putnam procedure, revised. Working Notes AAAI Spring Symposioum on AI and NP-Hard Problems (1993) 29–35
R. Dechter and J. Pearl: Tree clustering for constraint networks. Artificial Inteligence 38 (1989) 353–366
J.A. Ellis, I.H. Sudborough, and J.S. Turner: The vertex separation number of a graph. Proceedings 1983 Allerton Conference on Comunication and Computing 224–233.
M. Franklin, Z. Galil, and M. Yung: Eavesdropping games: A graph-theoretic approach to privacy in distributed systems. Proceedings 34th Annual Symposioum on Fountations of Computer Science (FOCS) 1993, IEEE Computer Society Press (1993) 670–679
E.C. Freuder: A sufficient condition for backtrack-free search. Journal of the Association for Computing Machinery 29 (1982) 24–32
E.C. Freuder: A sufficient condition for backtrack-bounded search. Journal of the Association for Computing Machinery 32 (1985) 755–761
F. Gavril: The intersection graphs of subtrees in trees are exactly the chordal graphs. Journal of Combinatorial Theory (Series B) 16 (1974) 47–56
N.G. Kinnersley: The vertex separation number of a graph equals its path-width. Information Processing Letters 42 (1992) 345–350
L.M. Kirousis and C.H. Papadimitriou: Interval graphs and searching. Discrete Mathematics 55 (1985) 181–184
L.M. Kirousis and C.H. Papadimitriou: Searching and pebbling. Journal of Theoretical Computer Science 47 (1986) 205–218
L.M. Kirousis and D.M. Thilikos: The Linkage of a Graph. Technical Report TR 93.04.16, Computer Technology Institute, Patras, Greece (1993)
A.S. LaPaugh: Recontamination does not help to search a graph. Journal of the Association for Computing Machinery 40 (1993) 224–245
A. Mackworth: Constraint Satisfaction. In: S.C. Shapiro (ed.) Encyclopedia of Artificial Inteligence, Wiley, N.Y. (1992) 276–285
A. Mackworth and E. Freuder: The complexity of some polynomial network consistency algorithms for constraint satisfaction problems. Artificial Inteligence 25 (1985) 65–74
D.W. Matula: A min-max theorem for graphs with application to graph coloring. SIAM Rev. 10 (1968) 481–482
N. Megiddo, S.L. Hakimi, M.R. Garey, D.S. Johnson, and C.H. Papadimitriou: The complexity of searching a graph. Journal of the Association for Computing Machinery 35 (1988) 18–44
R.H. Möhring: Graph problems related to gate matrix layout and PLA folding. In: E. Mayr, H. Noltemeier, and M. Syslo (eds.) Computational Graph Theory, Computing Supplementum, 7 (1990) 17–51
T.D. Parsons: Pursuit-evasion in a graph. In: Y. Alavi and D.R. Lick (eds.) Theory and Applications of Graphs, Springer-Verlag (1976) 426–441
T.D. Parsons: The search number of a connected graph. In: Proceedings 9th Southeastern Conference on Combinatorics, Graph Theory, and Computing, Utilitas Mathematica, Winnipeg, Canada (1978), 549–554
N. Robertson and P.D. Seymour: Graph Minors III. Planar tree-width. Journal of Combinatorial Theory (Series B) 36 (1984) 49–64
P.D. Seymour and R. Thomas: Graph searching and a minimax theorem for tree-width. Journal of Combinatorial Theory (Series B) 58 (1993) 22–33
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dendris, N.D., Kirousis, L.M., Thilikos, D.M. (1995). Fugitive-search games on graphs and related parameters. In: Mayr, E.W., Schmidt, G., Tinhofer, G. (eds) Graph-Theoretic Concepts in Computer Science. WG 1994. Lecture Notes in Computer Science, vol 903. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-59071-4_59
Download citation
DOI: https://doi.org/10.1007/3-540-59071-4_59
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-59071-2
Online ISBN: 978-3-540-49183-5
eBook Packages: Springer Book Archive