New Bounds for Approximating Extremal Distances in Undirected Graphs.
Massimo CairoRoberto GrossiRomeo RizziPublished in: SODA (2016)
Keyphrases
- undirected graph
- approximation algorithms
- directed graph
- upper bound
- directed acyclic graph
- spanning tree
- graph structure
- connected components
- lower bound
- complex networks
- graph theory
- lower and upper bounds
- upper and lower bounds
- positive integer
- worst case
- multicommodity flow
- disjoint paths
- minimum cost
- strongly connected
- random graphs
- vertex set
- random walk
- graph structures
- graphical models
- state space
- pairwise