Bi-Connectivity Augmentation for Specified Vertices of a Graph with Upper Bounds on Vertex-Degree Increase.
Toshiya MashimaTakanori FukuokaSatoshi TaokaToshimasa WatanabePublished in: IEICE Trans. Inf. Syst. (2006)
Keyphrases
- upper bound
- undirected graph
- labeled graphs
- hamiltonian cycle
- vertex set
- minimum weight
- edge weights
- strongly connected
- random graphs
- attributed graphs
- weighted graph
- connected components
- directed graph
- lower bound
- average degree
- connected subgraphs
- maximum cardinality
- upper and lower bounds
- triangle mesh
- spanning tree
- bipartite graph
- graph connectivity
- directed edges
- betweenness centrality
- business intelligence
- worst case
- graph structure
- lower and upper bounds
- random walk
- phase transition
- adjacency matrix
- planar graphs
- graph theory
- minimum cost
- traveling salesman problem
- directed acyclic graph
- approximation algorithms
- graph matching
- constant factor
- complex networks
- query graph
- biological networks
- graph data
- graph clustering
- maximum matching
- branch and bound algorithm
- graph model