An ant-based algorithm for coloring graphs-Reference-Cited by-同舟云学术

An ant-based algorithm for coloring graphs

Published:2008-01 Issue:2 Volume:156 Page:190-200
ISSN:0166-218X
Container-title:Discrete Applied Mathematics
language:en
Short-container-title:Discrete Applied Mathematics

Author:

Bui Thang N.,Nguyen ThanhVu H.,Patel Chirag M.,Phan Kim-Anh T.

Publisher

Elsevier BV

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics

Reference25 articles.

1. A multi-agent system for frequency assignment in cellular radio networks;Abril;IEEE Trans. Vehicular Technol.,2000

2. Free bits, PCPs and non-approximability—towards tight results;Bellare;SIAM J. Comput.,1998

3. Inspiration for optimization from social insect behavior;Bonabeau;Nature,2000

4. New methods to color the vertices of a graph;Brelaz;Commun. ACM,1979

5. T.N. Bui, C. Patel, An ant system algorithm for coloring graphs, in: Computational Symposium on Graph Coloring and Its Generalizations, COLOR02, Cornell University, 2002.

Cited by 44 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A distribution evolutionary algorithm for the graph coloring problem;Swarm and Evolutionary Computation;2023-07

2. Exact and heuristic approaches for the root sequence index allocation problem;Applied Soft Computing;2022-11

3. New evolutionary operators in coloring DIMACS challenge benchmark graphs;International Journal of Information Technology;2022-08-19

4. Solving Graph Coloring Problem Using Divide and Conquer-Based Turbulent Particle Swarm Optimization;Arabian Journal for Science and Engineering;2021-11-25

5. Population-based gradient descent weight learning for graph coloring problems;Knowledge-Based Systems;2021-01