scientific article; zbMATH DE number 7278027

DOI10.4230/LIPICS.ISAAC.2017.22zbMATH Open1457.91111MaRDI QIDQ5136239FDOQ5136239

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

Publication date: 25 November 2020

Title of this publication is not available (Why is that?)

zbMATH Keywords

linear programminggraph algorithmsturn-by-turn games in graphs

Mathematics Subject Classification ID

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

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Vertex-to-vertex pursuit in a graph
• 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
• Pursuing a fast robber on a graph
• Cops and robbers from a distance
• Cops and robbers is EXPTIME-complete
• Eternally dominating large grids
• Eternal domination numbers of \(5\times n\) grid graphs
• Connected Surveillance Game

Cited In (3)

• Study of a combinatorial game in graphs through linear programming
• Combinatorial analysis of a subtraction game on graphs
• An algorithmic analysis of a combinatorial game

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5136239)