The smallest hard-to-color graph for algorithm DSATUR.
Robert JanczewskiMarek KubaleKrzysztof ManuszewskiKonrad PiwakowskiPublished in: Discret. Math. (2001)
Keyphrases
- optimization algorithm
- learning algorithm
- dynamic programming
- matching algorithm
- computational complexity
- graph model
- expectation maximization
- cost function
- computational cost
- worst case
- recognition algorithm
- clustering method
- optimal solution
- graph based algorithm
- color constancy
- maximum flow
- simulated annealing
- particle swarm optimization
- k means
- search space
- objective function