Applied Soft Computing (2024). [4] A memetic algorithm for graph coloring. European Journal of Operational Research (2010). Back to "Combinatorics and Discrete Mathematics" ...

Researchers have demonstrated that families of geometric figures, such as pseudo-discs in the plane, can be assigned colours in a conflict-free manner with logarithmic bounds, thereby extending ...

David S. Johnson, Cecilia R. Aragon, Lyle A. McGeoch, Catherine Schevon, Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and ...

The Hadwiger-Nelson problem is a bit different. Instead of considering a finite number of vertices, as there would be on a map, it considers infinitely many vertices, one for each point in the plane.

Abstract Graph algorithms are notorious for not getting good speedup on parallel architectures. These algorithms tend to suffer from irregular dependencies and a high synchronization cost that prevent ...