Cops and Robbers on Dynamic Graphs: Offline and Online Case

We examine the classic game of Cops and Robbers played on models of dynamic graphs, that is, graphs evolving over discrete time steps. At each time step, a graph instance is generated as a subgraph of the underlying graph of the model. The cops and the robber take their turns on the current graph in...

Full description

Saved in:

Bibliographic Details
Published in:	Discrete mathematics and theoretical computer science Vol. 25:1; no. Discrete Algorithms; pp. 1 - 20
Main Authors:	Balev, Stefan, Jiménez Laredo, Juan, Lamprou, Ioannis, Pigné, Yoann, Sanlaville, Eric
Format:	Journal Article
Language:	English
Published:	Nancy DMTCS 01.01.2023 Discrete Mathematics & Theoretical Computer Science
Subjects:	[info.info-dm]computer science [cs]/discrete mathematics [cs.dm] [info.info-ro]computer science [cs]/operations research [cs.ro] Algorithms Apexes Computer Science cops and robbers Discrete Mathematics dynamic graphs Evolution Games Graph theory Graphs offline online Operations Research Robbery sparse cops and robbers dynamic graphs offline online sparse
ISSN:	1365-8050, 1462-7264, 1365-8050
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!