Open access
Aug 2026
On Shortest Path, BFS- and DFS-Tree Graphs
It is proved that shortest path tree graphs are hamiltonian, and an optimal linear-time algorithm for reconfiguration in shortest path tree graphs is provided, providing an optimal linear-time algorithm for reconfiguration in shortest path tree graphs.
Prosenjit Bose, Amirali Madani, Anil Maheshwari et al.
· Journal of Graph Algorithms... · 0 citations