Recommendations
- Connected Search for a Lazy Robber
- Searching for a Visible, Lazy Fugitive
- Searching for a Visible, Lazy Fugitive
- Lazy cops and robbers on hypercubes
- Locating a robber with multiple probes
- Locating a robber on a graph
- Pursuing a fast robber on a graph
- Lazy Cops and Robbers on generalized hypercubes
- Catching a fast robber on the grid
- A faster algorithm for cops and robbers
Cites work
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- A partial k-arboretum of graphs with bounded treewidth
- A primer for undergraduate research. From groups and tiles to frames and vaccines
- Algorithmic graph minor theory: Improved grid minor bounds and Wagner's contraction
- An annotated bibliography on guaranteed graph searching
- Bounding connected tree-width
- Bucket elimination: A unifying framework for reasoning
- Connected graph searching
- Connected graph searching in chordal graphs
- Connected Graph Searching in Outerplanar Graphs
- Connected tree-width
- Connected Treewidth and Connected Graph Searching
- Contracting planar graphs to contractions of triangulations
- Contraction obstructions for connected graph searching
- DECONTAMINATING CHORDAL RINGS AND TORI USING MOBILE AGENTS
- Forbidden minors characterization of partial 3-trees
- From pathwidth to connected pathwidth
- Fugitive-search games on graphs and related parameters
- Graph minors. XX: Wagner's conjecture
- Graph searching and a min-max theorem for tree-width
- Graph searching in a crime wave
- scientific article; zbMATH DE number 4147519 (Why is no real title available?)
- scientific article; zbMATH DE number 176249 (Why is no real title available?)
- scientific article; zbMATH DE number 3590298 (Why is no real title available?)
- scientific article; zbMATH DE number 1151792 (Why is no real title available?)
- scientific article; zbMATH DE number 7651203 (Why is no real title available?)
- In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen
- Interval graphs and searching
- Monotonicity in graph searching
- Monotony properties of connected visible graph searching
- Nondeterministic graph searching: from pathwidth to treewidth
- Obstruction set isolation for the gate matrix layout problem
- On Linear Recognition of Tree-Width at Most Four
- On the monotonicity of games generated by symmetric submodular functions.
- Quickly excluding a forest
- Recontamination does not help to search a graph
- Searching and pebbling
- Searching and sweeping graphs: a brief survey
- Searching is not jumping.
- Sweeping graphs with large clique number
- The theory of search games and rendezvous.
- The vertex separation number of a graph equals its path-width
- Upper bounds on the size of obstructions and intertwines
Cited in
(6)
This page was built for publication: Connected search for a lazy robber
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6080862)
