Minimum augmentation to bi-connect specified vertices of a graph with upper bounds on vertex-degree.
Toshiya MashimaTakanori FukuokaSatoshi TaokaToshimasa WatanabePublished in: ISCAS (1) (2005)
Keyphrases
- upper bound
- undirected graph
- minimum weight
- labeled graphs
- hamiltonian cycle
- spanning tree
- edge weights
- random graphs
- vertex set
- attributed graphs
- weighted graph
- constant factor
- lower bound
- bipartite graph
- average degree
- connected subgraphs
- directed graph
- minimum cost
- maximum cardinality
- approximation algorithms
- worst case
- adjacency matrix
- lower and upper bounds
- random walk
- graph theoretic
- betweenness centrality
- business intelligence
- branch and bound algorithm
- graph partitioning
- planar graphs
- directed acyclic graph
- graph matching
- directed edges
- graph structure
- graph theory
- minimum length
- maximum matching
- greedy heuristic
- upper and lower bounds
- dominating set
- phase transition
- connected components
- tight upper and lower bounds
- subgraph isomorphism
- biological networks
- graph representation
- graph databases
- traveling salesman problem
- np hard
- min sum
- maximal cliques
- graph data
- optimal solution