scientific article; zbMATH DE number 7278027

DOI10.4230/LIPIcs.ISAAC.2017.22zbMath1457.91111MaRDI QIDQ5136239

Stéphane Pérennes, Nathann Cohen, Nicolas Nisse, Inerney Fionn mc

Publication date: 25 November 2020

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

linear programminggraph algorithmsturn-by-turn games in graphs

Mathematics Subject Classification ID

Linear programming (90C05) Games involving graphs (91A43) Graph algorithms (graph-theoretic aspects) (05C85) Combinatorial games (91A46) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (1)

Study of a combinatorial game in graphs through linear programming

Cites Work

• Cops and robbers from a distance
• A game of cops and robbers
• Vertex-to-vertex pursuit in a graph
• Cops and robbers is EXPTIME-complete
• Pursuing a fast robber on a graph
• Eternally dominating large grids
• To satisfy impatient web surfers is hard
• Connected Surveillance Game
• A Bound for the Cops and Robbers Problem
• The Domination Number of Grids
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: