Capturing an invisible robber using separators
From MaRDI portal
Cites work
- A game of cops and robbers
- A partition approach to lower bounds for zero-visibility cops and robber
- A tight lower bound for the capture time of the cops and robbers game
- Applications of a Planar Separator Theorem
- Approximating the pathwidth of outerplanar graphs
- Cops and Robbers on diameter two graphs
- Cops and robbers on multi-layer graphs
- Cops and Robbers on Planar‐Directed Graphs
- Edge and node searching problems on trees
- scientific article; zbMATH DE number 3997549 (Why is no real title available?)
- Hyperbolic random graphs: separators and treewidth
- Improved Approximation Algorithms for Minimum Weight Vertex Separators
- Limited visibility cops and robber
- Logspace versions of the theorems of Bodlaender and Courcelle
- On the Capture Time of Cops and Robbers Game on a Planar Graph
- On the largest component of subcritical random hyperbolic graphs
- One-visibility cops and robber on trees: optimal cop-win strategies
- The capture time of a graph
- The complexity of zero-visibility cops and robber
- The cops and robber game on graphs with forbidden (induced) subgraphs
- The game of cops and robbers on graphs
- Treewidth of graphs with balanced separations
- Variations on cops and robbers
- Vertex-to-vertex pursuit in a graph
- Zero-visibility cops and robber and the pathwidth of a graph
- Zero-visibility cops and robber game on a graph
This page was built for publication: Capturing an invisible robber using separators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7238545)
