A 7/6-approximation algorithm for the minimum 2-edge connected subgraph problem in bipartite cubic graphs.
Kenjiro TakazawaPublished in: Inf. Process. Lett. (2016)
Keyphrases
- learning algorithm
- undirected graph
- np hard
- detection algorithm
- computational complexity
- adjacency graph
- closed form
- objective function
- graph structure
- matching algorithm
- approximation ratio
- directed graph
- dynamic programming
- graph partitioning
- graph model
- graph databases
- spanning tree
- graph search
- polygonal approximation
- minimum spanning tree
- connected subgraphs
- graph mining
- weighted graph
- graph theory
- segmentation algorithm
- random walk
- expectation maximization
- simulated annealing
- k means