A note on the online first-fit algorithm for coloring \(k\)-inductive graphs

DOI10.1016/J.IPL.2008.08.006zbMath1191.68886OpenAlexW1966342737MaRDI QIDQ975523

Shakhar Smorodinsky

Publication date: 9 June 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2008.08.006

zbMATH Keywords

analysis of algorithmsgraph algorithmson-line algorithms

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph algorithms (graph-theoretic aspects) (05C85) Online algorithms; streaming algorithms (68W27)

Related Items (3)

On the Grundy number of Cameron graphs ⋮ First-fit chromatic numbers of \(d\)-degenerate graphs ⋮ Online Conflict-Free Colouring for Hypergraphs

Cites Work

• Coloring inductive graphs on-line
• On-line and first fit colorings of graphs
• The Linearity of First-Fit Coloring of Interval Graphs

This page was built for publication: A note on the online first-fit algorithm for coloring \(k\)-inductive graphs