The complexity of rerouting shortest paths

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.

[1]  Reinhard Diestel,et al.  Graph Theory , 1997 .

[2]  Martin Milanic,et al.  Shortest Paths between Shortest Paths and Independent Sets , 2010, IWOCA.

[3]  Takehiro Ito,et al.  Reconfiguration of list edge-colorings in a graph , 2009, Discret. Appl. Math..

[4]  Christos H. Papadimitriou,et al.  The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies , 2006, SIAM J. Comput..

[5]  Jan van den Heuvel,et al.  Mixing 3-colourings in bipartite graphs , 2007, Eur. J. Comb..

[6]  Gerhard J. Woeginger,et al.  Motion Planning with Pulley, Rope, and Baskets , 2013, Theory of Computing Systems.

[7]  Walter J. Savitch,et al.  Relationships Between Nondeterministic and Deterministic Tape Complexities , 1970, J. Comput. Syst. Sci..

[8]  Jan van den Heuvel,et al.  Finding paths between 3‐colorings , 2011, IWOCA.

[9]  Martin Milanic,et al.  Complexity of independent set reconfigurability problems , 2012, Theor. Comput. Sci..

[10]  Mihalis Yannakakis,et al.  On the complexity of local search , 1990, STOC '90.

[11]  Marthe Bonamy,et al.  Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs , 2014, J. Comb. Optim..

[12]  Paul D. Seymour,et al.  The structure of claw-free graphs , 2005, BCC.

[13]  Takehiro Ito,et al.  On the complexity of reconfiguration problems , 2011, Theor. Comput. Sci..

[14]  Martin Milanic,et al.  Shortest paths between shortest paths , 2011, Theor. Comput. Sci..

[15]  Paul S. Bonsma.  Shortest Path Reconfiguration is PSPACE-hard , 2010, ArXiv.

[16]  Paul S. Bonsma,et al.  Finding Paths between graph colourings: PSPACE-completeness and superpolynomial distances , 2007, Theor. Comput. Sci..

[17]  Jan van den Heuvel,et al.  Connectedness of the graph of vertex-colourings , 2008, Discret. Math..

[18]  Erik D. Demaine,et al.  PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation , 2002, Theor. Comput. Sci..