Minimum Augmentation of Edge-connectivity between Vertices and Sets of Vertices in Undirected Graphs.
Toshimasa IshiiYoko AkiyamaHiroshi NagamochiPublished in: Electron. Notes Theor. Comput. Sci. (2003)
Keyphrases
- undirected graph
- spanning tree
- connected components
- minimum cost
- vertex set
- disjoint paths
- directed graph
- directed acyclic graph
- approximation algorithms
- random graphs
- strongly connected
- complex networks
- weighted graph
- graph structure
- adjacency matrix
- positive integer
- lower bound
- multicommodity flow
- average degree
- worst case
- np hard