Refining with colors Mathematicians have developed various strategies to compare graphs. Since the 1970s, algorithms have been able to test graph isomorphism, but in exponential time.

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

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

“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 ...