Study of a combinatorial game in graphs through linear programming
From MaRDI portal
Publication:5136239
DOI10.4230/LIPICS.ISAAC.2017.22zbMATH Open1457.91111MaRDI QIDQ5136239FDOQ5136239
Authors: Nathann Cohen, Inerney Fionn mc, Nicolas Nisse, Stéphane Pérennes
Publication date: 25 November 2020
Recommendations
Linear programming (90C05) Graph algorithms (graph-theoretic aspects) (05C85) Games on graphs (graph-theoretic aspects) (05C57) Games involving graphs (91A43) Combinatorial games (91A46)
Cites Work
- Graph theory
- Vertex-to-vertex pursuit in a graph
- The game of cops and robbers on graphs
- A bound for the cops and robbers problem
- A game of cops and robbers
- The domination number of grids
- To satisfy impatient web surfers is hard
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Pursuing a fast robber on a graph
- Cops and robbers from a distance
- Cops and robbers is EXPTIME-complete
- Eternal domination numbers of \(4\times n\) grid graphs
- Title not available (Why is that?)
- Spy-game on graphs
- Eternally dominating large grids
- Eternal domination numbers of \(5\times n\) grid graphs
- Connected surveillance game
Cited In (5)
This page was built for publication: Study of a combinatorial game in graphs through linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5136239)