Minimum augmentation of edge-connectivity with monotone requirements in undirected graphs.
Toshimasa IshiiPublished in: Discret. Optim. (2009)
Keyphrases
- undirected graph
- connected components
- spanning tree
- minimum cost
- disjoint paths
- strongly connected
- approximation algorithms
- directed graph
- directed acyclic graph
- vertex set
- binary images
- complex networks
- graph structure
- random graphs
- positive integer
- average degree
- relational databases
- closed form
- linear programming
- upper bound
- np hard
- special case