On-line edge-coloring with a fixed number of colors

DOI10.1007/s00453-002-0992-3zbMath1026.68155OpenAlexW2765379080MaRDI QIDQ1566383

Morten Nyhave Nielsen, Lene Monrad Favrholdt

Publication date: 2 June 2003

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-002-0992-3

zbMATH Keywords

edge-coloringcompetitive analysison-line algorithmsmaximization problemfair algorithmsfixed number of colors

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Related Items (8)

Online Dual Edge Coloring of Paths and Trees ⋮ Maximal edge-colorings of graphs ⋮ Maximal edge colorings of graphs ⋮ Online edge coloring of paths and trees with a fixed number of colors ⋮ The maximum edge-disjoint paths problem in complete graphs ⋮ Packing \([1, \Delta \)-factors in graphs of small degree] ⋮ Comparing first-fit and next-fit for online edge coloring ⋮ Approximating the maximum 2- and 3-edge-colorable subgraph problems

This page was built for publication: On-line edge-coloring with a fixed number of colors