A Linear Time Algorithm for Bi-Connectivity Augmentation of Graphs with Upper Bounds on Vertex-Degree Increase.
Takanori FukuokaToshiya MashimaSatoshi TaokaToshimasa WatanabePublished in: IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (2005)
Keyphrases
- upper bound
- lower bound
- directed graph
- labeled graphs
- undirected graph
- attributed graphs
- upper and lower bounds
- strongly connected
- random graphs
- efficiently computable
- graph theory
- graph matching
- maximum cardinality
- vertex set
- tight bounds
- worst case
- graph clustering
- subgraph isomorphism
- topological information
- graph mining
- branch and bound
- connected components
- theoretical analysis
- hamiltonian cycle
- graph representation
- sample complexity
- average degree
- np hard