Skip to content

Author

Anil Maheshwari

We have 1 of 13 papers

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

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. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.