A polynomial algorithm for the max-cut problem on graphs without long odd cycles.
Martin GrötschelGeorge L. NemhauserPublished in: Math. Program. (1984)
Keyphrases
- detection algorithm
- significant improvement
- np hard
- learning algorithm
- preprocessing
- optimization algorithm
- dynamic programming
- experimental evaluation
- times faster
- cost function
- computational cost
- high accuracy
- k means
- particle swarm optimization
- linear programming
- graph structure
- similarity measure
- minimum spanning tree
- convergence rate
- matching algorithm
- segmentation algorithm
- simulated annealing
- worst case
- search space
- computational complexity