A tight bound for online coloring of disk graphs

Lecture Notes in Computer Science

Volumn 3499, Issue , 2005, Pages 79-88

  Caragiannis, Ioannis ^a   Fishkin, Aleksei V ^b   Kaklamanis, Christos ^a   Papaioannou, Evi ^a  

^a UNIVERSITY OF PATRAS   (Greece)

^b MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; DOS; ONLINE SYSTEMS;

DISK GRAPHS; DISK REPRESENTATION; INPUT GRAPHS; ONLINE COLORING ALGORITHMS;

GRAPH THEORY;

EID: 24944569181     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11429647_8     Document Type: Conference Paper

References (16)

1. A. Borodin and R. El-Yaniv. Online computation and competitive analysis. Cambridge University Press, 1998.
2. I. Caragiannis, A. V. Fishkin, C. Kaklamanis, and E. Papaioannou. Online algorithms for disk graphs. In Proc. of the 29th International Symposium on Mathematical Foundations of Computer Science (MFCS '04), LNCS 3153, Springer, pp. 215-226, 2004.
3. B.N. Clark, C.J. Colbourn, and D.S. Johnson. Unit disk graphs. Discrete Mathematics, 86, pp. 165-177, 1990.
4. T. Erlebach and J. Fiala. On-line coloring of geometric intersection graphs. Computational Geometry: Theory and Applications, 9(1-2), pp. 3-24, 2002.
5. T. Erlebach and J. Fiala. Independence and coloring problems on intersection graphs of disks. Manuscript, 2003.
6. J. Fiala, A.V. Fishkin, and F.V. Fomin. Off-line and on-line distance constrained labeling of graphs. In Proc. of the 9th Annual European Symposium on Algorithms (ESA '01), LNCS 2161, pp. 464-475, 2001.
7. A. Gräf. Coloring and recognizing special graph classes. Musikinformatik und Medientechnik Bericht 20/95, Johannes Gutenberg, Universität Mainz, 1995.
8. A. Gräf, M. Stumpf, and G. Weissenfels. On coloring unit disk graphs. Algorithmica, 20(3), pp. 277-293, 1998.
9. A. Gyárfás and J. Lehel. On-line and first fit colorings of graphs. Journal of Graph Theory, 12(2), pp. 217-227, 1988.
10. D.K. Hale. Frequency assignment: theory and applications. In Proc. of the IEEE, 68(12), pp. 1497-1514, 1980.
11. P. Hliněný and J. Kratochvíl. Representing graphs by disks and balls. Discrete Mathematics, 229(1-3), pp. 101-124, 2001.
12. S. Irani. Coloring inductive graphs on-line. Algorithmica, 11, pp. 53-72, 1994.
13. E. Malesińska. Graph theoretical models for frequency assignment problems. PhD Thesis, Technical University of Berlin, 1997.
14. M.V. Marathe, H. Breu, H.B. Hunt III, S.S. Ravi, and D.J. Rosenkrantz. Simple hueristics for unit disk graphs. Networks, 25, pp. 59-68, 1995.
15. R. Peeters. On coloring j-unit sphere graphs. Technical report, Dept. of Economics, Tilburg University, 1991.
16. S. Vishwanathan. Randomized online coloring of graphs. In Proc. of the 31st Annual Symposium on Foundations of Computer Science (FOCS '90), 1990.