14 citations · 52 across the 23 of their papers we have counts for
1 paper · 1 filter
Tristan Cazenave, Benjamin Negrevergne, Florian Sikora
Graph Coloring is probably one of the most studied and famous problem in graph algorithms. Exact methods fail to solve instances with more than few hundred vertices, therefore, a l…