Applied Soft Computing (2024). [4] A memetic algorithm for graph coloring. European Journal of Operational Research (2010).

The unified framework helps integrate earlier work and leads to fresh insights; enables the design of more efficient algorithms for many problems; leads to new algorithms for others; and eases the ...

A theoretical computer scientist has presented an algorithm that is being hailed as a breakthrough in mapping the obscure terrain of complexity theory, which explores how hard computational problems ...

Bhaswar B. Bhattacharya, COLLISION TIMES IN MULTICOLOR URN MODELS AND SEQUENTIAL GRAPH COLORING WITH APPLICATIONS TO DISCRETE LOGARITHMS, The Annals of Applied Probability, Vol. 26, No. 6 (December ...

A paper posted online last month has disproved a 53-year-old conjecture about the best way to assign colors to the nodes of a network. The paper shows, in a mere three pages, that there are better ...