Cops and Robbers on Dynamic Graphs: Offline and Online Case
DOI10.1007/978-3-030-54921-3_12OpenAlexW3046543812MaRDI QIDQ5100960FDOQ5100960
Authors: Stefan Balev, Juan Luis Laredo Jiménez, Ioannis Lamprou, Yoann Pigné, Eric Sanlaville 
Publication date: 1 September 2022
Published in: Structural Information and Communication Complexity (Search for Journal in Brave)
Full work available at URL: https://hal-normandie-univ.archives-ouvertes.fr/hal-02927320v2/file/cop-robber-full.pdf
Graph theory (including graph drawing) in computer science (68R10) Computer system organization (68Mxx) Communication complexity, information complexity (68Q11)
Cites Work
- Infinite Games
- Cops and robbers in graphs with large girth and Cayley graphs
- On the cop number of a graph
- On a game of policemen and robber
- Vertex-to-vertex pursuit in a graph
- Cops and robbers in a random graph
- A note on \(k\)-cop, \(l\)-robber games on graphs
- Meyniel's conjecture holds for random graphs
- On Meyniel's conjecture of the cop number
- Chasing robbers on random graphs: zigzag theorem
- Pursuit-evasion in models of complex networks
- The game of cops and robbers on graphs
- A bound for the cops and robbers problem
- A game of cops and robbers
- Characterizations and algorithms for generalized cops and robbers games
- Cops and robbers from a distance
- Distributed chasing of network intruders
- Cops and robbers is EXPTIME-complete
- Characterizations of \(k\)-copwin graphs
- \(k\)-chordal graphs: from cops and robber to compact routing via treewidth
- Note on a pursuit game played on graphs
- An introduction to temporal graphs: an algorithmic perspective
- Title not available (Why is that?)
- A game of cops and robbers on graphs with periodic edge-connectivity
Cited In (3)
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)
