The Undirected Two Disjoint Shortest Paths Problem.
Marinus GottschauMarcus KaiserClara WaldmannPublished in: CoRR (2018)
Keyphrases
- shortest path
- weighted graph
- shortest path problem
- shortest path algorithm
- finding the shortest path
- road network
- routing algorithm
- pairwise
- directed graph
- optimal path
- flow graph
- geodesic distance
- graph partitioning
- path length
- spanning tree
- nearest neighbor
- mobile robot
- shortest distance
- strongly connected components
- high dimensional