Minimum Augmentation of Edge-Connectivity between Vertices and Sets of Vertices in Undirected Graphs.
Toshimasa IshiiYoko AkiyamaHiroshi NagamochiPublished in: Algorithmica (2010)
Keyphrases
- undirected graph
- spanning tree
- minimum cost
- connected components
- directed graph
- vertex set
- strongly connected
- approximation algorithms
- disjoint paths
- directed acyclic graph
- weighted graph
- graph structure
- average degree
- complex networks
- random graphs
- adjacency matrix
- binary images
- positive integer
- np hard
- edge weights
- pairwise