| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 439252 | Theoretical Computer Science | 2008 | 10 Pages |
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
