An annotated bibliography on guaranteed graph searching
Reads0
Chats0
TLDR
This annotated bibliography gives an elementary classification of problems and results related to graph searching and provides a source of bibliographical references on this field.About:
This article is published in Theoretical Computer Science.The article was published on 2008-06-10 and is currently open access. It has received 362 citations till now. The article focuses on the topics: Graph (abstract data type) & Graph database.read more
Citations
More filters
Book
Parameterized Algorithms
Marek Cygan,Fedor V. Fomin,Lukasz Kowalik,Daniel Lokshtanov,Dániel Marx,Marcin Pilipczuk,Michał Pilipczuk,Saket Saurabh +7 more
TL;DR: This comprehensive textbook presents a clean and coherent account of most fundamental tools and techniques in Parameterized Algorithms and is a self-contained guide to the area, providing a toolbox of algorithmic techniques.
Journal ArticleDOI
Search and pursuit-evasion in mobile robotics
TL;DR: A taxonomy of search problems is provided that highlights the differences resulting from varying assumptions on the searchers, targets, and the environment and highlights current open problems in the area and explores avenues for future work.
Book
The Game of Cops and Robbers on Graphs
TL;DR: One of the main goals of the book is to bring together the key results in the field; as such, it presents structural, probabilistic, and algorithmic results on Cops and Robbers games.
Journal ArticleDOI
Pursuing a fast robber on a graph
TL;DR: It is proved that computing the minimum number of cops that are guaranteed to catch a robber on a given graph is NP-hard and that the parameterized version of the problem is W[2]-hard; the proof extends to the case where the robber moves s time faster than the cops.
References
More filters
Journal ArticleDOI
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
TL;DR: Every minor-closed class of graphs that does not contain all planar graphs has a linear-time recognition algorithm that determines whether the treewidth of G is at most at most some constant $k$ and finds a tree-decomposition of G withtreewidth at most k.
Journal ArticleDOI
Complexity of finding embeddings in a k -tree
TL;DR: This work determines the complexity status of two problems related to finding the smallest number k such that a given graph is a partial k-tree and presents an algorithm with polynomially bounded (but exponential in k) worst case time complexity.
Journal ArticleDOI
A partial k -arboretum of graphs with bounded treewidth
TL;DR: This survey paper wants to give an overview of many classes of graphs that can be seen to have a uniform upper bound on the treewidth of graphs in the class.
Proceedings ArticleDOI
Semistructured data
TL;DR: A number of issues surrounding semistructured data are covered: finding a concise formulation, building a sufficiently expressive language for querying and transformation, and optimizat,ion problems.