Abstract
Graph searching encompasses a wide variety of combinatorial problems related to the problem of capturing a fugitive residing in a graph using the minimum number of searchers. In this annotated bibliography, we give an elementary classification of problems and results related to graph searching and provide a source of bibliographical references on this field. © 2008.
Author supplied keywords
Cite
CITATION STYLE
APA
Fomin, F. V., & Thilikos, D. M. (2008). An annotated bibliography on guaranteed graph searching. Theoretical Computer Science, 399(3), 236–245. https://doi.org/10.1016/j.tcs.2008.02.040
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