Fast edge splitting and Edmonds' arborescence construction for unweighted graphs.
Anand BhalgatRamesh HariharanTelikepalli KavithaDebmalya PanigrahiPublished in: SODA (2008)
Keyphrases
- undirected graph
- edge weights
- minimum weight
- weighted graph
- bipartite graph
- spanning tree
- directed graph
- construction process
- minimum spanning trees
- graph structure
- edge detection
- graph matching
- edge information
- approximation algorithms
- shortest path
- directed acyclic graph
- graph clustering
- multi agent
- graph model
- graph theoretic
- pairwise
- minimum cost
- minimum spanning tree
- graph structures
- series parallel
- adjacency graph