Spy-game on graphs
From MaRDI portal
Publication:5282808
DOI10.4230/LIPICS.FUN.2016.10zbMATH Open1369.91034MaRDI QIDQ5282808FDOQ5282808
Authors: Nathann Cohen, Mathieu Hilaire, Nicolas Nisse, Stéphane Pérennes, N. Martins
Publication date: 17 July 2017
Recommendations
Analysis of algorithms and problem complexity (68Q25) 2-person games (91A05) Games involving graphs (91A43)
Cited In (14)
- Study of a combinatorial game in graphs through linear programming
- Study of a combinatorial game in graphs through linear programming
- Title not available (Why is that?)
- Connected surveillance game
- Revolutionaries and Spies on Random Graphs
- Knights, spies, games and ballot sequences
- Revolutionaries and spies
- Spy-game on graphs: complexity and simple topologies
- Revolutionaries and spies: spy-good and spy-bad graphs
- Revolutionaries and spies on trees and unicyclic graphs
- Games with espionage
- Spy game: FPT-algorithm, hardness and graph products
- Spy game: FPT-algorithm and results on graph products
- Span of a Graph: Keeping the Safety Distance
This page was built for publication: Spy-game on graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5282808)