| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 438307 | Theoretical Computer Science | 2007 | 9 Pages |
Abstract
We present an improved upper bound on the competitiveness of the online colouring algorithm First-Fit in disk graphs, which are graphs representing overlaps of disks on the plane. We also show that this bound is best possible for deterministic online colouring algorithms that do not use the disk representation of the input graph. We also present a related new lower bound for unit disk graphs.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
