A 1.5-approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2.
Guy EvenGuy KortsarzZeev NutovPublished in: Inf. Process. Lett. (2011)
Keyphrases
- segmentation algorithm
- detection algorithm
- preprocessing
- k means
- strongly connected
- computational cost
- learning algorithm
- closed form
- edge detection algorithm
- graph based algorithm
- maximum flow
- graph partitioning
- undirected graph
- weighted graph
- graph structure
- connected components
- tree structure
- expectation maximization
- dynamic programming
- np hard
- cost function
- error bounds
- clustering method
- graph model
- probabilistic model
- minimum spanning tree
- graph clustering
- randomized algorithm
- optimal solution