A Timecop's Work Is Harder Than You Think - CNRS - Centre national de la recherche scientifique Accéder directement au contenu
Communication Dans Un Congrès Année : 2020

A Timecop's Work Is Harder Than You Think

Résumé

We consider the (parameterized) complexity of a cop and robber game on periodic, temporal graphs and a problem on periodic sequences to which these games relate intimately. In particular, we show that it is NP-hard to decide (a) whether there is some common index at which all given periodic, binary sequences are 0, and (b) whether a single cop can catch a single robber on an edge-periodic temporal graph. We further present results for various parameterizations of both problems and show that hardness not only applies in general, but also for highly limited instances. As one main result we show that even if the graph has a size-2 vertex cover and is acyclic in each time step, the cop and robber game on periodic, temporal graphs is NP-hard and W[1]-hard when parameterized by the size of the underlying input graph.
Fichier principal
Vignette du fichier
LIPIcs-MFCS-2020-71.pdf (570.27 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03004095 , version 1 (13-11-2020)

Licence

Paternité

Identifiants

Citer

Nils Morawietz, Carolin Rehs, Mathias Weller. A Timecop's Work Is Harder Than You Think. 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020), Aug 2020, Prague, Czech Republic. pp.71:1--71:14, ⟨10.4230/LIPIcs.MFCS.2020.71⟩. ⟨hal-03004095⟩
103 Consultations
56 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More