A discrete firefly algorithm based on similarity for graph coloring problems
Research article (2017 18th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD), 2017) · cited 11× · AI/ML
Press Enter · cited answer in seconds
0 sources
A discrete firefly algorithm based on similarity for graph coloring problems
Summary
A discrete firefly algorithm based on similarity for graph coloring problems is a scholarly article[1].
Key Facts
- A discrete firefly algorithm based on similarity for graph coloring problems's instance of is recorded as scholarly article[2].