Abstract
Graph searching is the game of capturing a fugitive by a team of searchers in a network. There are equivalent characterizations in terms of path-width, interval thickness, and vertex separation. So far the interest has mainly focused on the search number of a graph, which is the minimal the number of searchers to win the game, and accordingly on the width and the thickness. These parameters measure the needed resources and correspond to space complexity. As its dual, we introduce the search time, which has not yet been studied in graph searching. We prove that all main results on graph searching can be generalized to include search time, such as monotone or recontamination free graph searching, and the characterizations in terms of path-width, interval graphs, and vertex separation, for which we introduce appropriate length parameters. We establish the NP-completeness of both search-width and search-time. Finally we investigate the speed-up by an extra searcher. There are ’good’ classes of graphs where a single extra searcher reduces the search time to one half and ’bad’ ones where some extra searchers are no real help.
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
Arnborg, S., Corneil, D.G., Proskurowski, A.: Complexity of Finding Embeddings in a k-Tree. SIAM J. Alg. Disc. Meth. 8, 277–284 (1987)
Bienstock, D.: Graph Searching, Path-Width, Tree-Width and Related Problems (a Survey). DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 5, pp. 33–49. American Mathematical Society, Providence (1991)
Bienstock, D., Seymour, P.D.: Monotonicity in Graph Searching. J. Algorithms 12, 239–245 (1991)
Bodlaender, H.L.: A Linear Time Algorithm for Finding Tree-Decompositions of Small Treewidth. SIAM J. Comput. 25, 1305–1317 (1996)
Bodlaender, H.L., Kloks, T., Kratsch, D.: Treewidth and Pathwidth of Permutation Graphs. SIAM J. Discrete Math. 8, 606–616 (1995)
Bodlaender, H.L., Möhring, R.: The Pathwidth and Treewidth of Cographs. SIAM J. Discrete Math. 6, 181–188 (1993)
Brandenburg, F.J., Skodinis, K.: Finite Graph Automata for Linear and Boundary Graph Languages. Theoret. Computer Sci. 332, 199–232 (2005)
Chang, R.S.: Single Step Graph Search Problem. Inform. Proc. Letters 40, 107–111 (1991)
Dendris, N.D., Kirousis, L.M., Thilikos, D.M.: Fugitive-Search Games on Graphs and Related Parameters. Theoret. Computer Sci. 172, 233–254 (1997)
Downey, R.G., Fellows, M.R.: Parametrized Complexity. Springer, Heidelberg (1999)
Ellis, J.A., Sudborough, I.H., Turner, J.: The Vertex Separation and Search Number of a Graph. Inform. and Comput. 113, 50–79 (1994)
Fomin, F.: Helicopter Search Problems, Bandwidth and Pathwidth. Discrete Appl. Math. 85, 59–71 (1998)
Fomin, F.V.: Searching Expenditure and Interval Graphs. Discrete Appl. Math. 135, 97–104 (2004)
Fomin, F.V., Golovach, P.A.: Graph Searching and Interval Completion. SIAM J. Discrete Math. 13, 454–464 (2000)
Franklin, M., Galil, Z., Yung, M.: Eavesdropping Games: a Graph-Theoretic Approach to Privacy in Distributed Systems. J. Assoc. Comput. Mach. 47, 225–243 (2000)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)
Gustedt, J.: On the Pathwidth of Chordal Graphs. Discrete Applied Math 45, 223–248 (1993)
Hajos, G.: Über eine Art von Graphen. Mathematische Nachrichten 11 (1957)
Kinnersley, N.G.: The Vertex Separation Number of a Graph Equals Its Path-Width. Inform. Proc. Letters 42, 345–350 (1992)
Kirousis, L.M., Papadimitriou, C.H.: Interval Graphs and Searching. Discrete Appl. Math. 55, 181–184 (1985)
Kirousis, L.M., Papadimitriou, C.H.: Searching and Pebbling. Theoret. Comput. Sci. 47, 205–218 (1986)
Kloks, T.: Treewidth. LNCS, vol. 842. Springer, Heidelberg (1994)
LaPaugh, A.S.: Recontamination Does Not Help to Search a Graph. J. Assoc. Comput. Mach. 40, 224–245 (1993)
Lengauer, T.: Black-White Pebbles and Graph Separation. Acta Inform. 16, 465–475 (1981)
Megiddo, N., Hakimi, S.L., Garey, M.R., Johnson, D.S., Papadimitriou, C.H.: The Complexity of Searching a Graph. J. Assoc. Comput. Mach. 35, 18–44 (1988)
Parsons, T.D.: Pursit-Evasion in Graphs. In: Theory and Application in Graphs, pp. 426–441. Springer, Berlin (1976)
Robertson, N., Seymour, P.D.: Graph Minors I. Excluding a Forest. J. Combin. Theory Ser. B 35, 39–61 (1983)
Seymour, P.D., Thomas, R.: Graph Searching and a Min-Max Theorem for Tree-Width. Journal of Combinatorial Theory, Series B 58, 22–33 (1993)
Skodinis, K.: Construction of Linear Tree-Layouts which Are Optimal with Respect to Vertex Vertex Separation in Linear Time. J. Algorithms 47, 40–59 (2003)
Wagner, K., Wechsung, G.: Computational Complexity. Reidel, Dordrecht (1986)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Brandenburg, F.J., Herrmann, S. (2006). Graph Searching and Search Time. In: Wiedermann, J., Tel, G., Pokorný, J., Bieliková, M., Štuller, J. (eds) SOFSEM 2006: Theory and Practice of Computer Science. SOFSEM 2006. Lecture Notes in Computer Science, vol 3831. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11611257_17
Download citation
DOI: https://doi.org/10.1007/11611257_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-31198-0
Online ISBN: 978-3-540-32217-7
eBook Packages: Computer ScienceComputer Science (R0)