Restorable Shortest Path Tiebreaking for Edge-Faulty Graphs.
Greg BodwinMerav ParterPublished in: CoRR (2021)
Keyphrases
- graph mining
- shortest path
- weighted graph
- edge weights
- graph databases
- shortest path problem
- road network
- shortest path algorithm
- routing algorithm
- travel time
- flow graph
- finding the shortest path
- path length
- path selection
- strongly connected components
- edge detection
- graph search
- minimal surface
- graph partitioning
- minimum spanning tree
- undirected graph
- minimum cost flow
- dijkstra algorithm
- spanning tree