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

Shakhar Smorodinsky

doi:10.1016/j.ipl.2008.08.006

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

Shakhar Smorodinsky

Department of Mathematics

Research output: Contribution to journal › Article › peer-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 language	English
Pages (from-to)	44-45
Number of pages	2
Journal	Information Processing Letters
Volume	109
Issue number	1
DOIs	https://doi.org/10.1016/j.ipl.2008.08.006
State	Published - 16 Dec 2008

Keywords

Analysis of algorithms
Graph algorithms
On-line algorithms

ASJC Scopus subject areas

Theoretical Computer Science
Signal Processing
Information Systems
Computer Science Applications

Access to Document

10.1016/j.ipl.2008.08.006

Cite this

@article{12f9856259b94ca1bd1ec46e855bd441,

title = "A note on the online First-Fit algorithm for coloring k-inductive graphs",

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.",

keywords = "Analysis of algorithms, Graph algorithms, On-line algorithms",

author = "Shakhar Smorodinsky",

year = "2008",

month = dec,

day = "16",

doi = "10.1016/j.ipl.2008.08.006",

language = "English",

volume = "109",

pages = "44--45",

journal = "Information Processing Letters",

issn = "0020-0190",

publisher = "Elsevier B.V.",

number = "1",

}

TY - JOUR

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

AU - Smorodinsky, Shakhar

PY - 2008/12/16

Y1 - 2008/12/16

N2 - 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.

AB - 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.

KW - Analysis of algorithms

KW - Graph algorithms

KW - On-line algorithms

UR - https://www.scopus.com/pages/publications/55149092517

U2 - 10.1016/j.ipl.2008.08.006

DO - 10.1016/j.ipl.2008.08.006

M3 - Article

AN - SCOPUS:55149092517

SN - 0020-0190

VL - 109

SP - 44

EP - 45

JO - Information Processing Letters

JF - Information Processing Letters

IS - 1

ER -

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

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this