Minimum Augmentation to k-Edge-Connect Specified Vertices of a Graph.
Satoshi TaokaToshimasa WatanabePublished in: ISAAC (1994)
Keyphrases
- weighted graph
- undirected graph
- edge weights
- spanning tree
- vertex set
- minimum cut
- minimum cost
- graph partitioning
- graph model
- edge disjoint
- adjacency matrix
- graph structure
- shortest path
- approximation algorithms
- labeled graphs
- minimum spanning tree
- minimum weight
- disjoint paths
- hamiltonian cycle
- random graphs
- directed graph
- graph clustering
- connected components
- strongly connected
- dominating set
- edge detection
- graph construction
- directed acyclic graph
- structured data
- graph representation
- data objects
- bipartite graph
- densely connected
- maximum cardinality
- directed edges