An annotated bibliography on guaranteed graph searching

2008/04/14 by Fedor V. Fomin, Dimitrios M. Thilikos · 2 citations
Computer Science · #Advanced Graph Theory Research #Algorithms and Data Compression #Annotated bibliography #Bibliography #Computer science #Graph #Information retrieval #Library science #Optimization and Search Problems #Theoretical computer science

paper · pdf · doi:10.1016/j.tcs.2008.02.040

openalex publication_date 2008/04/14 · crossref created 2008/04/14 · crossref issued 2008/06/01 · crossref published 2008/06/01 · crossref published-print 2008/06/01 · crossref deposited 2025/10/05 · openalex created_date 2025/10/10 · crossref indexed 2026/03/25 · openalex updated_date 2026/08/02

Citations

• On the Cop Number of a Graph
• Vertex-to-vertex pursuit in a graph
• A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
• The Vertex Separation and Search Number of a Graph
• Complexity of Finding Embeddings in a k -Tree
• A partial k-arboretum of graphs with bounded treewidth

Cited by

• A Distributed Algorithm for Computing the Node Search Number in Trees
• Pursuit–evasion [wikipedia]