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

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.

Combined with algorithms that can handle such graphs it’s a great way to not only make the basic structure of a network clear, but also to model structures and systems.

"Professor tackles graph mining challenges with new algorithm." ScienceDaily. ScienceDaily, 18 October 2024. <www.sciencedaily.com / releases / 2024 / 10 / 241018162554.htm>.

Extensive empirical studies on real and synthetic graphs demonstrate that our techniques outperform the state-of-the-art algorithms on six datasets. DOI: 10.1007/s11704-023-3626-3 ...