Minimum Augmentation to Tri-connect a Bi-connected Graph with Upper Bounds on Vertex-degree.
Toshiya MashimaSatoshi TaokaToshimasa WatanabePublished in: ISCAS (2009)
Keyphrases
- upper bound
- constant factor
- directed graph
- undirected graph
- lower bound
- connected components
- spanning tree
- edge weights
- hamiltonian cycle
- minimum weight
- random graphs
- labeled graphs
- random walk
- vertex set
- attributed graphs
- branch and bound
- upper and lower bounds
- graph representation
- lower and upper bounds
- graph theory
- average degree
- business intelligence
- minimum cost
- graph theoretic
- directed acyclic graph
- connected graphs
- strongly connected
- graph model
- weighted graph
- tight bounds
- shortest path
- edge disjoint
- maximum cardinality
- betweenness centrality
- special case
- neighborhood graph
- graph construction
- markov random field
- bipartite graph
- dominating set
- social networks