Faster Vizing and near-Vizing edge coloring algorithms

DOI10.1137/1.9781611978322.165MaRDI QIDQ7289751zbMATH OpenFDO

Authors Sepehr Assadi

Publication date 3 July 2026

Full work available at URL https://doi.org/10.1137/1.9781611978322.165

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(3)

• A simple algorithm for near-Vizing edge-coloring in near-linear time
• Vizing's theorem in near-linear time
• Improved streaming edge coloring

This page was built for publication: Faster Vizing and near-Vizing edge coloring algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7289751)