Computer Science – Computational Complexity
Scientific paper
2010-09-16
Computer Science
Computational Complexity
The results on claw-free graphs, chordal graphs and isolated paths have been added in version 2 (april 2012). Version 1 (Septe
Scientific paper
The Shortest Path Reconfiguration problem has as input a graph G (with unit edge lengths) with vertices s and t, and two shortest st-paths P and Q. The question is whether there exists a sequence of shortest st-paths that starts with P and ends with Q, such that subsequent paths differ in only one vertex. This is called a rerouting sequence. This problem is shown to be PSPACE-complete. For claw-free graphs and chordal graphs, it is shown that the problem can be solved in polynomial time, and that shortest rerouting sequences have linear length. For these classes, it is also shown that deciding whether a rerouting sequence exists between all pairs of shortest st-paths can be done in polynomial time. Finally, a polynomial time algorithm for counting the number of isolated paths is given.
No associations
LandOfFree
The Complexity of Rerouting Shortest Paths does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with The Complexity of Rerouting Shortest Paths, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Complexity of Rerouting Shortest Paths will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-27970