Comparing First-Fit and Next-Fit for Online Edge Coloring

DOI10.1007/978-3-540-92182-0_11zbMath1183.68749OpenAlexW2137326476MaRDI QIDQ3596709

Rodica Mihai, Jens S. Kohrt, Martin R. Ehmsen, Lene Monrad Favrholdt

Publication date: 29 January 2009

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-92182-0_11

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Online algorithms; streaming algorithms (68W27)

Related Items (2)

Comparing online algorithms for bin packing problems ⋮ A new variable-sized bin packing problem

This page was built for publication: Comparing First-Fit and Next-Fit for Online Edge Coloring