Cops and Robbers on Dynamic Graphs: Offline and Online Case
From MaRDI portal
Publication:5100960
Recommendations
Cites work
- scientific article; zbMATH DE number 2187680 (Why is no real title available?)
- A bound for the cops and robbers problem
- A game of cops and robbers
- A game of cops and robbers on graphs with periodic edge-connectivity
- A note on \(k\)-cop, \(l\)-robber games on graphs
- An introduction to temporal graphs: an algorithmic perspective
- Characterizations and algorithms for generalized cops and robbers games
- Characterizations of k-copwin graphs
- Chasing robbers on random graphs: zigzag theorem
- Cops and robbers from a distance
- Cops and robbers in a random graph
- Cops and robbers in graphs with large girth and Cayley graphs
- Cops and robbers is EXPTIME-complete
- Distributed chasing of network intruders
- Infinite Games
- Meyniel's conjecture holds for random graphs
- Note on a pursuit game played on graphs
- On Meyniel's conjecture of the cop number
- On a game of policemen and robber
- On the cop number of a graph
- Pursuit-evasion in models of complex networks
- The game of cops and robbers on graphs
- Vertex-to-vertex pursuit in a graph
- \(k\)-chordal graphs: from cops and robber to compact routing via treewidth
Cited in
(5)
This page was built for publication: Cops and Robbers on Dynamic Graphs: Offline and Online Case
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5100960)