Spy-game on graphs: Complexity and simple topologies
Authors:
- Nathann CohenNCNathann Cohen
- Nícolas A. MartinsNMNícolas A. Martins
- Fionn Mc InerneyFIFionn Mc Inerney
- Nicolas NisseNNNicolas Nisse
- Stéphane PérennesSPStéphane Pérennes
- Rudini SampaioRSRudini Sampaio
- 1 May 2018
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 725, 1-15
Abstract
No abstract availableKeywords
Funding Information
- Agence Nationale de la Recherche (ANR-13-BS02-0007)
- Agence Nationale de la Recherche (ANR-11-LABX-0031-01)
- AlDyNet (EQA-041301)
- FUNCAP/FAPs/Inria/INS2i-CNRS (INC-0083-00047.01.00/13)
This publication has 15 references indexed in Scilit:
- Catching a fast robber on the gridJournal of Combinatorial Theory, Series A, 2017
- Cops and Robber with ConstraintsSIAM Journal on Discrete Mathematics, 2012
- Patrolling GamesOperations Research, 2011
- Cops and Robber Game Without RechargingTheory of Computing Systems, 2011
- On a Generalization of Meyniel's Conjecture on the Cops and Robbers GameThe Electronic Journal of Combinatorics, 2011
- Cop and Robber Games When the Robber Can Hide and RideSIAM Journal on Discrete Mathematics, 2011
- Cops and Robbers from a distanceTheoretical Computer Science, 2010
- Pursuing a fast robber on a graphTheoretical Computer Science, 2010
- Algorithmic construction of sets for k -restrictionsACM Transactions on Algorithms, 2006
- A game of cops and robbersDiscrete Applied Mathematics, 1984