1 citations · 2 across the 2 of their papers we have counts for
2 papers
cs.CC2024★ 1 cited
Parameterized Shortest Path Reconfiguration
Nicolas Bousquet, Kshitij Gajjar, Abhiruk Lahiri +1
An st-shortest path, or st-path for short, in a graph G is a shortest (induced) path from s to t in G. Two st-paths are said to be adjacent if they differ on exactly one vertex. A…
cs.DS2021★ 1 cited
Reconfiguring Shortest Paths in Graphs
Kshitij Gajjar, Agastya Vibhuti Jha, Manish Kumar +1
Reconfiguring two shortest paths in a graph means modifying one shortest path to the other by changing one vertex at a time so that all the intermediate paths are also shortest pat…