33 citations · 94 across the 15 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.DS2024
The Canadian Traveller Problem on outerplanar graphs
Laurent Beaudou, Pierre Bergé, Vsevolod Chernyshev +5
We study the -Canadian Traveller Problem, where a weighted graph with a source and a target are given. This problem also has a hidden input $E_* \s…
cs.DS2010★ 3 cited
2-FREE-FLOOD-IT is polynomial
Aurelie Lagoutte
We study a discrete diffusion process introduced in some combinatorial games called FLOODIT and MADVIRUS that can be played online and whose computational complexity has been recen…