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

DOI10.1007/978-3-540-92182-0_11zbMATH Open1183.68749OpenAlexW2137326476MaRDI QIDQ3596709FDOQ3596709

Authors: Martin R. Ehmsen, Jens S. Kohrt, Rodica Mihai, Lene M. 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

Recommendations

• Comparing first-fit and next-fit for online edge coloring
• On-line edge-coloring with a fixed number of colors
• On-line interval graphs coloring — Modification of the First-Fit algorithm and its performance ratio
• scientific article; zbMATH DE number 2080195
• Online edge coloring of paths and trees with a fixed number of colors

Mathematics Subject Classification ID

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

Cited In (4)

• Comparing first-fit and next-fit for online edge coloring
• Comparing online algorithms for bin packing problems
• On-line edge-coloring with a fixed number of colors
• A new variable-sized bin packing problem

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

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