An ant-based algorithm for coloring graphs.
Thang Nguyen BuiThanhVu H. NguyenChirag M. PatelKim-Anh T. PhanPublished in: Discret. Appl. Math. (2008)
Keyphrases
- preprocessing
- learning algorithm
- improved algorithm
- computational cost
- np hard
- optimization algorithm
- objective function
- computational complexity
- experimental evaluation
- high accuracy
- recognition algorithm
- convergence rate
- times faster
- detection algorithm
- theoretical analysis
- k means
- lower bound
- worst case
- segmentation algorithm
- search space
- data clustering
- optimal solution
- graph structure
- neural network
- simulated annealing
- computationally efficient
- probabilistic model
- graph theory
- decision trees
- minimum spanning tree