scientific article; zbMATH DE number 2080195

zbMATH Open1044.68696MaRDI QIDQ4472437FDOQ4472437

Authors: Morten N. Nielsen, Lene M. Favrholdt 

Publication date: 4 August 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/1974/19740106.htm

Title of this publication is not available (Why is that?)

Recommendations

• On-line edge-coloring with a fixed number of colors
• scientific article; zbMATH DE number 65699
• Online edge coloring of paths and trees with a fixed number of colors
• The greedy algorithm is optimal for on-line edge coloring
• Lower bounds for on-line graph coloring

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05) Coloring of graphs and hypergraphs (05C15)

Cited In (8)

• Comparing first-fit and next-fit for online edge coloring
• On-line coloring between two lines
• Online edge coloring of paths and trees with a fixed number of colors
• A 1.43-competitive online graph edge coloring algorithm in the random order arrival model
• The greedy algorithm is optimal for on-line edge coloring
• Online graph edge-coloring in the random-order arrival model
• Comparing First-Fit and Next-Fit for Online Edge Coloring
• On-line edge-coloring with a fixed number of colors

This page was built for publication:

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