Graph Sparsification by Edge-Connectivity and Random Spanning Trees
Wai Shing FungNicholas J. A. HarveyPublished in: CoRR (2010)
Keyphrases
- spanning tree
- undirected graph
- weighted graph
- edge weights
- minimum spanning trees
- edge disjoint
- minimum spanning tree
- minimum weight
- minimum cost
- graph connectivity
- strongly connected
- disjoint paths
- root node
- edge detection
- vertex set
- connected components
- edge information
- total length
- adjacency matrix
- graph laplacian
- lower bound
- special case
- edge detector
- depth first search
- np hard
- shortest path
- graph structure
- bipartite graph