A Faster Shortest-Paths Algorithm for Minor-Closed Graph Classes.
Siamak TazariMatthias Müller-HannemannPublished in: WG (2008)
Keyphrases
- shortest path
- finding the shortest path
- shortest path problem
- strongly connected components
- dynamic programming
- shortest path algorithm
- path length
- graph model
- minimum cut
- flow graph
- weighted graph
- graph partitioning
- edge weights
- graph search
- objective function
- path planning
- np hard
- minimum cost flow
- expectation maximization