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

We present scalability results of a parallel graph coloring algorithm, three variations of a breadth-first search algorithm and a microbenchmark for irregular computations using these three programming ...

“The new algorithm is a remarkable tour de force,” said Giuseppe Italiano, a computer scientist at Luiss University and a co-author of the 1996 paper describing what is now the second-fastest ...