Abstract
Suppose that there is a robber hiding on vertices or along edges of a graph or digraph. Graph searching is concerned with finding the minimum number of searchers required to capture the robber. Major results of graph searching problems are surveyed, focusing on algorithmic, structural, and probabilistic aspects of the field.
Cite
CITATION STYLE
APA
Bonato, A., & Yang, B. (2013). Graph searching and related problems. In Handbook of Combinatorial Optimization (Vol. 3–5, pp. 1511–1558). Springer New York. https://doi.org/10.1007/978-1-4419-7997-1_76
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free