A Composition Algorithm for Very Hard Graph 3-Colorability Instances.
Seiichi NishiharaKazunori MizunoKohsuke NishiharaPublished in: CP (2003)
Keyphrases
- randomly generated
- cost function
- dynamic programming
- graph based algorithm
- computational cost
- worst case
- preprocessing
- graph structure
- search space
- k means
- tree structure
- expectation maximization
- learning algorithm
- particle swarm optimization
- significant improvement
- optimal solution
- probabilistic model
- segmentation algorithm
- detection algorithm
- ant colony optimization
- convex hull
- lower bound
- shortest path problem
- graph search
- maximum flow
- objective function