BibTeX
@INPROCEEDINGS{Irani94coloringinductive,
author = {Sandy Irani},
title = {Coloring inductive graphs on-line},
booktitle = {Algorithmica},
year = {1994},
pages = {470--479}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Citations
| 682 | Amortized efficiency of list update and paging rules - Sleator, Tarjan - 1985 |
| 91 | The case for the reduced instruction set computer - Patterson, Ditzel - 1980 |
| 38 | On-line and first fit colorings of graphs - Gyárfás, Lehel - 1998 |
| 34 | An online graph coloring algorithm with sublinear performance ratio - Lovász, Saks, et al. - 1989 |
| 25 | On the performance of on-line algorithms for partition problems - Falgle, Kern, et al. - 1989 |
| 24 | allocation and spilling via graph coloring - Register - 2006 |
| 7 | A dynamic location problem for graphs - Chung, Graham, et al. - 1989 |
| 7 | An extremal problem in recursive combinatorics, Congressus Numerantium 33 - Kierstead, Trotter - 1981 |
| 1 | The linearity if first-fit coloring of interval graphs - Kierstead - 1988 |
| 1 | Personal communication, transmitted through [8]. [12] S. Vishwanathan. Randomized online coloring of graphs - Szegedy - 1990 |
