On the All-Pairs-Shortest-Path Problem in Unweighted Undirected Graphs.
Raimund SeidelPublished in: J. Comput. Syst. Sci. (1995)
Keyphrases
- shortest path problem
- undirected graph
- directed graph
- directed acyclic graph
- single source
- interval data
- shortest path
- random walk
- spanning tree
- approximation algorithms
- edge weights
- graph structure
- random variables
- pairwise
- random graphs
- minimum cost
- combinatorial optimization problems
- disjoint paths
- complex networks
- multiple objectives
- connected components
- special case
- search space