22 citations · 112 across the 37 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2025
An algorithmic Vizing's theorem: toward efficient edge-coloring sampling with an optimal number of colors
Lucas De Meyer, František Kardoš, Aurélie Lagoutte +1
The problem of sampling edge-colorings of graphs with maximum degree has received considerable attention and efficient algorithms are available when the number of colors is lar…
cs.DS2018
The Glauber dynamics for edge-colourings of trees
Michelle Delcourt, Marc Heinrich, Guillem Perarnau
Let be a tree on vertices and with maximum degree . We show that for the Glauber dynamics for -edge-colourings of mixes in polynomial time in . The…
cs.DS2018★ 2 cited
Improved Bounds for Randomly Sampling Colorings via Linear Programming
Sitan Chen, Michelle Delcourt, Ankur Moitra +2
A well-known conjecture in computer science and statistical physics is that Glauber dynamics on the set of -colorings of a graph on vertices with maximum degree is r…