Backtrack: An O(1) Expected Time Algorithm for the Graph Coloring Problem.
Herbert S. WilfPublished in: Inf. Process. Lett. (1984)
Keyphrases
- dynamic programming
- optimization algorithm
- expectation maximization
- k means
- improved algorithm
- np hard
- experimental evaluation
- learning algorithm
- computational complexity
- preprocessing
- search space
- selection algorithm
- computationally efficient
- space complexity
- neural network
- recognition algorithm
- linear programming
- simulated annealing
- worst case
- computational cost
- significant improvement
- similarity measure