A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf
.
Shortest Paths between Shortest Paths and Independent Sets
[chapter]
2011
Lecture Notes in Computer Science
We study problems of reconfiguration of shortest paths in graphs. We prove that the shortest reconfiguration sequence can be exponential in the size of the graph and that it is NP-hard to compute the shortest reconfiguration sequence even when we know that the sequence has polynomial length. Moreover, we also study reconfiguration of independent sets in three different models and analyze relationships between these models, observing that shortest path reconfiguration is a special case of
doi:10.1007/978-3-642-19222-7_7
fatcat:p74psoxaxnbyddqverwupwwkju