An improved approximation algorithm for maximum edge 2-coloring in simple graphs.
Zhi-Zhong ChenRuka TanahashiLusheng WangPublished in: J. Discrete Algorithms (2008)
Keyphrases
- detection algorithm
- objective function
- optimization algorithm
- optimal solution
- preprocessing
- error bounds
- np hard
- minimum spanning tree
- graph structure
- probabilistic model
- cost function
- learning algorithm
- absolute error
- max cut
- graph construction
- graph isomorphism
- polynomial time complexity
- undirected graph
- spanning tree
- matching algorithm
- segmentation algorithm
- search space
- multiscale
- image segmentation