54 citations · 152 across the 16 of their papers we have counts for
Showing cs.AIShow all
2 papers · 1 filter
cs.AI2025★ 6 cited
Monte Carlo Graph Coloring
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…
cs.AI2017
The shortest way to visit all metro lines in a city
Florian Sikora
What if a tourist, a train addict, Dr. Sheldon Cooper, somebody who likes to waste time wants to visit all metro lines or carriages in a given network in a minimum number o…