Cops and Robbers on Dynamic Graphs: Offline and Online Case
From MaRDI portal
Publication:5100960
DOI10.1007/978-3-030-54921-3_12OpenAlexW3046543812MaRDI QIDQ5100960
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)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Characterizations of \(k\)-copwin graphs
- Cops and robbers from a distance
- A game of cops and robbers
- Note on a pursuit game played on graphs
- Distributed chasing of network intruders
- 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
- Cops and robbers is EXPTIME-complete
- 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
- k-Chordal Graphs: From Cops and Robber to Compact Routing via Treewidth
- A Bound for the Cops and Robbers Problem
- A Game of Cops and Robbers on Graphs with Periodic Edge-Connectivity
- Infinite Games
- Characterizations and algorithms for generalized Cops and Robbers games
- An Introduction to Temporal Graphs: An Algorithmic Perspective*
This page was built for publication: Cops and Robbers on Dynamic Graphs: Offline and Online Case
