Minimum augmentation of local edge-connectivity between vertices and vertex subsets in undirected graphs.
Toshimasa IshiiMasayuki HagiwaraPublished in: Discret. Appl. Math. (2006)
Keyphrases
- undirected graph
- vertex set
- connected components
- minimum cost
- spanning tree
- strongly connected
- disjoint paths
- directed graph
- approximation algorithms
- directed acyclic graph
- random graphs
- graph structure
- weighted graph
- binary images
- complex networks
- average degree
- minimum weight
- image processing
- edge weights
- graph mining
- undirected graphical models
- graph structures
- graph matching
- level set
- optimal solution