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).
Derived graphs and digraphs
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2025 1verdicts
CONDITIONAL 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).