Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4949501 | Discrete Applied Mathematics | 2017 | 16 Pages |
Abstract
In this work we analyse the computational complexity of Shortest Connection Game. On the negative side, Shortest Connection Game turns out to be computationally hard even on restricted graph classes such as bipartite, acyclic and cactus graphs. On the positive side, we can give a polynomial time algorithm for cactus graphs when the game is restricted to simple paths.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Andreas Darmann, Ulrich Pferschy, Joachim Schauer,