-Edge-Connectivity Augmentation for Specified Vertices of a Graph with Upper Bounds on Vertex-Degree.
Toshiya MashimaSatoshi TaokaToshimasa WatanabePublished in: IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (2006)
Keyphrases
- undirected graph
- upper bound
- edge weights
- vertex set
- weighted graph
- strongly connected
- connected components
- random graphs
- minimum weight
- directed graph
- lower bound
- disjoint paths
- graph structure
- graph connectivity
- upper and lower bounds
- labeled graphs
- approximation algorithms
- spanning tree
- bipartite graph
- attributed graphs
- adjacency matrix
- average degree
- lower and upper bounds
- shortest path
- worst case
- complex networks
- minimum cost
- directed acyclic graph
- hamiltonian cycle
- maximum cardinality
- sample complexity
- graph model
- constant factor
- minimum spanning tree
- efficiently computable
- branch and bound algorithm
- connected subgraphs
- graph clustering
- graph partitioning
- level set
- objective function