A tight bound for online colouring of disk graphs

Theoretical Computer Science

Volumn 384, Issue 2-3, 2007, Pages 152-160

  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

Disk graphs; Graph colouring; Online algorithms

Indexed keywords

ALGORITHMS; ONLINE SYSTEMS;

DISK GRAPHS; DISK REPRESENTATION; GRAPH COLORING; ONLINE ALGORITHMS;

GRAPH THEORY;

EID: 34548477904     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2007.04.025     Document Type: Article

References (18)

1. Borodin A., and El-Yaniv R. Online Computation and Competitive Analysis (1998), Cambridge University Press
2. Caragiannis I., Fishkin A.V., Kaklamanis C., and Papaioannou E. Online algorithms for disk graphs. Proceedings of the 29th International Symposium on Mathematical Foundations of Computer Science. MFCS '04. LNCS vol. 3153 (2004), Springer 215-226
3. Clark B.N., Colbourn C.J., and Johnson D.S. Unit disk graphs. Discrete Mathematics 86 (1990) 165-177
4. Cormen T.H., Leiserson C.E., Rivest R.L., and Stein C. Introduction to Algorithms. 2nd ed. (2001), McGraw-Hill & MIT Press
5. Erlebach T., and Fiala J. On-line coloring of geometric intersection graphs. Computational Geometry: Theory and Applications 9 1-2 (2002) 3-24
6. Erlebach T., and Fiala J. Independence and coloring problems on intersection graphs of disks. In: Bampis E., et al. (Ed). Efficient Approximation and Online Algorithms. LNCS vol. 3484 (2006), Springer 135-155
7. Fiala J., Fishkin A.V., and Fomin F.V. On distance constrained labeling of disk graphs. Theoretical Computer Science 326 1-3 (2004) 261-292
8. A. Gräf, Coloring and recognizing special graph classes, Musikinformatik und Medientechnik Bericht 20/95, Johannes Gutenberg-Universität Mainz, 1995
9. Gräf A., Stumpf M., and Weissenfels G. On coloring unit disk graphs. Algorithmica 20 3 (1998) 277-293
10. Gyárfás A., and Lehel J. On-line and first fit colorings of graphs. Journal of Graph Theory 12 2 (1988) 217-227
11. Hale D.K. Frequency assignment: Theory and applications. Proceedings of the IEEE 68 12 (1980) 1497-1514
12. Hliněný P., and Kratochvíl J. Representing graphs by disks and balls. Discrete Mathematics 229 1-3 (2001) 101-124
13. Irani S. Coloring inductive graphs on-line. Algorithmica 11 (1994) 53-72
14. E. Malesińska, Graph theoretical models for frequency assignment problems, Ph.D. Thesis, Technical University of Berlin, 1997
15. Marathe M.V., Breu H., Hunt III H.B., Ravi S.S., and Rosenkrantz D.J. Simple heuristics for unit disk graphs. Networks 25 (1995) 59-68
16. R. Peeters, On coloring j-unit sphere graphs, Technical Report, Dept. of Economics, Tilburg University, 1991
17. Tsai Y.-T., Lin Y.-L., and Hsu F.R. The on-line first-fit algorithm for radio frequency assignment problems. Information Processing Letters 84 (2002) 195-199
18. S. Vishwanathan, Randomized online coloring of graphs, in: Proc. of the 31st Annual Symposium on Foundations of Computer Science, FOCS '90, 1990, pp. 464-469