Solving Graph Coloring Problem Using an Enhanced Binary Dragonfly Algorithm.
Karim BaicheYassine MeraihiManolo Dulva HinaAmar Ramdane-CherifMohammed MahseurPublished in: Int. J. Swarm Intell. Res. (2019)
Keyphrases
- learning algorithm
- experimental evaluation
- times faster
- theoretical analysis
- dynamic programming
- high accuracy
- segmentation algorithm
- computational cost
- np hard
- computational complexity
- optimal solution
- gradient projection
- improved algorithm
- detection algorithm
- optimization algorithm
- simulated annealing
- preprocessing
- search space
- cost function
- data sets
- input data
- expectation maximization
- computationally efficient
- significant improvement
- objective function
- tree structure
- similarity measure
- convex hull
- convergence rate
- k means
- quadratic programming