New hybrid decentralized evolutionary approach for DIMACS challenge graph coloring & wireless network instances

New hybrid decentralized evolutionary approach for DIMACS challenge graph coloring & wireless network instances

The Graph Coloring Problem is an NP-hard combinatorial optimization problem, and it is being used in different real-world environments. The chromatic integer is determined using different probabilistic methods. This paper explores a new hybrid decentralized evolutionary approach that applies the fix...

Full description

Bibliographic Details
Main Authors: S. Balakrishnan, Tamilarasi Suresh, Raja Marappan, R Venkatesan, Abdelouahed Sabri
Format: Article
Language:English
Published: KeAi Communications Co., Ltd. 2023-06-01
Series:International Journal of Cognitive Computing in Engineering
Subjects:
Channel allocation
Chromatic number
Combinatorial optimization
Divide and conquer
Evolutionary operators
Graph coloring
Online Access:http://www.sciencedirect.com/science/article/pii/S2666307423000256

Internet

http://www.sciencedirect.com/science/article/pii/S2666307423000256

Similar Items