A tight bound for online coloring of disk graphs

Authors:
Ioannis Caragiannis;Aleksei V. Fishkin;Christos Kaklamanis;Evi Papaioannou
Affiliations:
Research Academic Computer Technology Institute and Department of Computer Engineering and Informatics, University of Patras, Rio, Greece;Max Planck Institut für Informatik, Saarbrücken, Germany;Research Academic Computer Technology Institute and Department of Computer Engineering and Informatics, University of Patras, Rio, Greece;Research Academic Computer Technology Institute and Department of Computer Engineering and Informatics, University of Patras, Rio, Greece
Venue:
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
Year:
2005

Citing 6
Cited 3

Unit disk graphs

Discrete Mathematics - Topics on domination
Online computation and competitive analysis

Online computation and competitive analysis
Representing graphs by disks and balls (a survey of recognition-complexity results)

Discrete Mathematics
On-line coloring of geometric intersection graphs

Computational Geometry: Theory and Applications
Online and Offline Distance Constrained Labeling of Disk Graphs

ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Randomized online graph coloring

SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science

Location oblivious distributed unit disk graph coloring

SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
Local 7-coloring for planar subgraphs of unit disk graphs

TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Local 7-coloring for planar subgraphs of unit disk graphs

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an improved upper bound on the competitiveness of the online coloring 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 coloring algorithms that do not use the disk representation of the input graph. We also present a related new lower bound for unit disk graphs.