A new 'partition sieving' technique solves Edge Coloring and List Edge Coloring in O*(2^{m-3n/5}) time and polynomial space, the first polynomial-space algorithms faster than O*(2^m).
A fast distributed algorithm for ( +1) -edge-coloring
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.DS 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Faster Edge Coloring by Partition Sieving
A new 'partition sieving' technique solves Edge Coloring and List Edge Coloring in O*(2^{m-3n/5}) time and polynomial space, the first polynomial-space algorithms faster than O*(2^m).