Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: 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.

9
The categories of this paper are: nlin
5
The categories of this paper are: gr-qc
14
The categories of this paper are: math-ph
34
The categories of this paper are: chem-ph
0
The categories of this paper are: hep-ph
24
The categories of this paper are: dg-ga
33
The categories of this paper are: plasm-ph
29
The categories of this paper are: funct-an
2
The categories of this paper are: math
16
The categories of this paper are: stat
32
The categories of this paper are: atom-ph
8
The categories of this paper are: hep-ex
3
The categories of this paper are: physics
6
The categories of this paper are: astro-ph
35
The categories of this paper are: mtrl-th
37
The categories of this paper are: supr-con