Minimum augmentation of a tree to a K-edge-connected graph.
Shuichi UenoYoji KajitaniHajime WadaPublished in: Networks (1988)
Keyphrases
- spanning tree
- weighted graph
- undirected graph
- graph structure
- minimum spanning tree
- edge weights
- minimum spanning trees
- edge disjoint
- connected components
- tree shaped
- tree structure
- hierarchical data structure
- minimum cost
- neighborhood graph
- strongly connected
- disjoint paths
- vertex set
- maximum weight
- graph model
- minimum total cost
- connected dominating set
- random walk
- edge detection
- graph representation
- minimum cut
- edge information
- directed graph
- tree structures
- graph partitioning
- dominating set
- structured data
- reachability queries
- image processing
- constant factor
- bipartite graph
- connected graphs
- multiscale