21 citations · 42 across the 24 of their papers we have counts for
1 paper · 2 filters
Laurent Moalic, Alexandre Gondran
Graph vertex coloring with a given number of colors is a well-known and much-studied NP-complete problem.The most effective methods to solve this problem are proved to be hybrid al…