A 17/12-approximation algorithm for 2-vertex-connected spanning subgraphs on graphs with minimum degree at least 3.
Vishnu V. NarayanPublished in: CoRR (2016)
Keyphrases
- connected subgraphs
- error bounds
- undirected graph
- learning algorithm
- dynamic programming
- graph isomorphism
- computational complexity
- objective function
- minimum length
- detection algorithm
- worst case
- np hard
- matching algorithm
- approximation ratio
- probabilistic model
- simulated annealing
- connected components
- data structure
- graph theory
- graph structure
- spanning tree
- optimal solution
- minimum spanning tree
- subgraph isomorphism
- error tolerance
- maximum clique