On-line coloring of geometric intersection graphs

Computational Geometry: Theory and Applications

Volumn 23, Issue 2, 2002, Pages 243-255

  Erlebach, Thomas ^a   Fiala, Jiri ^b  

^a ETH ZURICH   (Switzerland)

^b CHARLES UNIVERSITY   (Czech Republic)

Author keywords

Coloring; Competitive analysis; Disk graphs; First fit; Intersection graphs

Indexed keywords

EID: 31244433753     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-7721(02)00089-5     Document Type: Article

References (19)

1. H. Breu, D.G. Kirkpatrick, On the complexity of recognizing intersection and touching graphs of disks, in: Proceedings of the 3rd Symposium on Graph Drawing GD'95, Lecture Notes in Computer Science, Vol. 1027, 1996, pp. 88-98.
2. H. Breu, D.G. Kirkpatrick, Unit disk graph recognition is NP-hard, Computational Geometry 9 (1-2) (1998) 3-24.
3. J. Burling, On coloring problems of families of prototypes, PhD thesis, University of Colorado, 1965.
4. B.N. Clark, C.J. Colbourn, D.S. Johnson, Unit disk graphs, Discrete Math. 86 (1-3) (1990) 165-177.
5. T. Erlebach, K. Jansen, E. Seidel, Polynomial-time approximation schemes for geometric graphs, in: Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms SODA'01, 2001, pp. 671-679.
6. J. Fiala, A.V. Fishkin, F.V. Fomin, Off-line and on-line distance constrained labeling of graphs, Manuscript. An extended abstract was published in: Proceedings of the 9th European Symposium on Algorithms ES A'Ol, Lecture Notes in Computer Science, Vol. 2161, 2001, pp. 464-475.
7. A. Graf, Coloring and recognizing special graph classes, Musikinformatik und Medientechnik Bericht 20/95, Johannes Gutenberg-Universität Mainz, 1995.
8. A. Gyarfäs, J. Lehel, On-line and first fit colourings of graphs, J. Graph Theory 12 (2) (1988) 217-227.
9. W.K. Hale, Frequency assignment: Theory and applications, Proc. IEEE 68 (12) (1980) 1497-1514.
10. P. Hlinëny, J. Kratochvfl, Representing graphs by disks and balls, Discrete Math. 229 (1-3) (2001) 101-124.
11. H.B. Hunt III, M.V. Marathe, V. Radhakrishnan, S.S. Ravi, D.J. Rosenkrantz, R.E. Stearns, NC-approximation schemes for NP- and PSPACE-hard problems for geometric graphs, J. Algorithms 26 (2) (1998) 238-274.
12. S. Irani, Coloring inductive graphs on-line, Algorithmica 11(1) (1994) 53-72.
13. P. Koebe, Kontaktprobleme der konformen Abbildung, Ber. Verh. Sachs. Akad. Leipzig 88 (1936) 141-164.
14. J. Kratochvfl, A special planar satisfiability problem and a consequence of its NP-completeness, Discrete Appl. Math. 52 (3) (1994) 233-252.
15. E. Malesinska. Graph theoretical models for frequency assignment problems, PhD thesis, Technical University of Berlin, 1997.
16. M.V. Marathe, H. Breu, H.B. Hunt III, S.S. Ravi, D.J. Rosenkrantz, Simple heuristics for unit disk graphs, Networks 25 (2) (1995) 59-68.
17. R. Peelers, On coloring ./-unit sphere graphs, Technical Report, Department of Economics, Tilburg University, 1991.
18. V. Raghavan, J. Spinrad, Robust algorithms for restricted domains, in: Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms SODA'01, 2001, pp. 460-467.
19. H. Sachs, Coin graphs, polyhedra, and conformai mapping, Discrete Math. 134 (1-3) (1994) 133-138.