Searching for a Visible, Lazy Fugitive
From MaRDI portal
Publication:5302068
DOI10.1007/978-3-540-92248-3_31zbMath1202.68287OpenAlexW1483387080MaRDI QIDQ5302068
David Richerby, Dimitrios M. Thilikos
Publication date: 20 January 2009
Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-92248-3_31
Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Games on graphs (graph-theoretic aspects) (05C57)
Related Items (2)
Digraph Decompositions and Monotonicity in Digraph Searching ⋮ Digraph decompositions and monotonicity in digraph searching
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Mixed searching and proper-path-width
- An annotated bibliography on guaranteed graph searching
- Linearity of grid minors in treewidth with applications through bidimensionality
- Interval graphs and searching
- The vertex separation number of a graph equals its path-width
- Mengerian theorems for paths of bounded length
- Graph searching and a min-max theorem for tree-width
- Quickly excluding a planar graph
- Fugitive-search games on graphs and related parameters
- Graph Searching in a Crime Wave
- Length-Bounded Cuts and Flows
- Complexity of Finding Embeddings in a k-Tree
- Monotonicity in graph searching
- The complexity of finding maximum disjoint paths with length constraints
- Contraction and Treewidth Lower Bounds
- Algorithms – ESA 2004
- Experimental and Efficient Algorithms
This page was built for publication: Searching for a Visible, Lazy Fugitive
