A complete algorithm to solve the graph-coloring problem.
Huberto AyaneguiAlberto Chávez-AragónPublished in: LA-NMR (2009)
Keyphrases
- objective function
- detection algorithm
- experimental study
- improved algorithm
- experimental evaluation
- learning algorithm
- cost function
- k means
- np hard
- dynamic programming
- computational cost
- convergence rate
- preprocessing
- high accuracy
- optimization algorithm
- significant improvement
- convex hull
- times faster
- expectation maximization
- computational complexity
- worst case
- matching algorithm
- single pass
- clustering method
- input data
- simulated annealing
- scheduling problem
- probabilistic model
- optimal solution
- similarity measure