An annotated bibliography on guaranteed graph searching

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. c 2008 Published by Elsevier B.V.

• Type: Journal
• Year: 2008
• Where: TCS
• Authors: Fedor V. Fomin, Dimitrios M. Thilikos
• Keywords: Combinatorial Problems, Minimum Number, TCS 2008, Theoretical Computer Science, Wide Variety