The Shortest Path Game: Complexity and Algorithms

DOI10.1007/978-3-662-44602-7_4zbMath1417.68065arXiv1506.00462OpenAlexW2184536951MaRDI QIDQ3190149

Joachim Schauer, Ulrich Pferschy, Andreas Darmann

Publication date: 15 September 2014

Published in: Advanced Information Systems Engineering (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1506.00462

zbMATH Keywords

computational complexitygame theoryshortest path problemcactus graph

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Paths and cycles (05C38) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (5)

On the computational complexities of various geography variants ⋮ On variants of vertex geography on undirected graphs ⋮ The shortest connection game ⋮ On the shortest path game ⋮ Two agent scheduling with a central selection mechanism

This page was built for publication: The Shortest Path Game: Complexity and Algorithms