16 citations · 52 across the 11 of their papers we have counts for
1 paper · 2 filters
Paul Bonsma
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 ex…