The Shortest Path Game: Complexity and Algorithms

Andreas Darmann, Ulrich Pferschy, Joachim Schauer. The Shortest Path Game: Complexity and Algorithms. In Josep Diaz, Ivan Lanese, Davide Sangiorgi, editors, Theoretical Computer Science - 8th IFIP TC 1/WG 2.2 International Conference, TCS 2014, Rome, Italy, September 1-3, 2014. Proceedings. Volume 8705 of Lecture Notes in Computer Science, pages 39-53, Springer, 2014. [doi]

Abstract

Abstract is missing.