A note on the online First-Fit algorithm for coloring k-inductive graphs

Research output: Contribution to journalArticlepeer-review

5 Scopus citations

Abstract

In a FOCS 1990 paper, S. Irani proved that the First-Fit online algorithm for coloring a graph uses at most O (k log n) colors for k-inductive graphs. In this note we provide a very short proof of this fact.

Original languageEnglish
Pages (from-to)44-45
Number of pages2
JournalInformation Processing Letters
Volume109
Issue number1
DOIs
StatePublished - 16 Dec 2008

Keywords

  • Analysis of algorithms
  • Graph algorithms
  • On-line algorithms

Fingerprint

Dive into the research topics of 'A note on the online First-Fit algorithm for coloring k-inductive graphs'. Together they form a unique fingerprint.

Cite this