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...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Discrete mathematics and theoretical computer science Jg. 25:1; H. Discrete Algorithms; S. 1 - 20
Hauptverfasser:	Balev, Stefan, Jiménez Laredo, Juan, Lamprou, Ioannis, Pigné, Yoann, Sanlaville, Eric
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Nancy DMTCS 01.01.2023 Discrete Mathematics & Theoretical Computer Science
Schlagworte:	[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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!