Abstract
In general, we define a disk graph (DG) as the intersection graph of a set of disks in the Euclidean plane. Recently, there has been increasing interest in studying the class of DGs. This primary motivated by its applications which can be found in radio networks, map labeling, and in sensor networks, just to name a few. From another side, DGs have a very simple geometric structure. This motivates the study of theoretical problems. Here we give a short survey on DGs. We briefly discuss coloring, independent set and clique. We include hardness results, main ideas used in approximation and online algorithms, lower and upper bounds. We also mention some open questions.
Partially supported by EU-Project CRESCCO, IST-2001-33135, and by EU-Project ARACNE, HPRN-CT-199-00112.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Agarwal, P.K., Overmars, M., Sharir, M.: Computing maximally separated sets in the plane and independent sets in the intersection graph of unit disks. In: Proceedings 15th Annual ACM-SIAM Symposium on Discrete Algorithms (2004) (to appear)
Baker, B.S.: Approximation algorithms for np-complete problems on planar graphs. Journal of the ACM 41, 153–180 (1994)
Breu, H.: Algorithmic Aspects of constrained unit disk graphs. PhD thesis, University of british Columbia (1996)
Breu, H., Kirkpatrick, D.G.: Unit disc graph recognition is NP-hard. Computational Geometry: Theory and Applications 9, 3–24 (1998)
Clark, B.N., Colbourn, C.J., Johnson, D.S.: Unit disk graphs. Discrete Mathematics 86, 165–177 (1990)
Erlebach, T., Fiala, J.: Independence and coloring problems on intersection graphs of disks (2001) (manuscript)
Erlebach, T., Fiala, J.: On-line coloring of geometric intersection graphs. Computational Geometry: Theory and Applications 23(2), 243–255 (2002)
Erlebach, T., Jansen, K., Seidel, E.: Polynomial-time approximation schemes for geometric graphs. In: Proceedings the 12th ACM-SIAM Symposium on Discrete Algorithms (SODA 2001), Washington, DC, January 7-9, pp. 671–679 (2001)
Fiala, J., Fishkin, A.V., Fomin, F.: Off-line and on-line distance constrained labeling of disk graphs. In: Meyer auf der Heide, F. (ed.) ESA 2001. LNCS, vol. 2161, pp. 464–475. Springer, Heidelberg (2001)
Gräf, A., Stumpf, M., Weisenfels, G.: On coloring unit disk graphs. Algorithmica 20(3), 277–293 (1998)
Gyárfás, A., Lehel, J.: On-line and first fit colorings of graphs. Journal of Graph Theory 12, 217–227 (1988)
Hliněný, P., Kratochvíl, J.: Representing graphs by disks and balls. Discrete Mathematics 229, 101–124 (2001)
Hochbaum, D., Maass, W.: Approximation schemes for covering and packing problems in image processing and vlsi. Journal of the ACM 32, 130–136 (1985)
HuntIII, H.B., Marathe, M.V., Radhakrishnan, V., Ravi, S.S., Rosenkrantz, D.J., Stearns, R.E.: NC-approximation schemes for NP and PSPACE-hard problems for geometric graphs. J. Algorithms 26(2), 238–274 (1998)
Koebe, P.: Kontaktprobleme der konformen Abbildung. In: Math.-Phys. Klasse. Berichte Verhande, vol. 88, pp. 141–164. Saechs. Akad. Wiss, Leipzig (1936)
Malesińska, E.: Graph theoretical models for frequency assignment problems. PhD thesis, Technical University of Berlin, Germany (1997)
Marathe, M.V., Breu, H., Hunt III, H.B., Ravi, S.S., Rosenkrantz, D.J.: Simple heuristics for unit disk graphs. Networks 25, 59–68 (1995)
Matsui, T.: Approximation algorithms for maximum independent set problems and fractional coloring problems on unit disk graphs. In: Akiyama, J., Kano, M., Urabe, M. (eds.) JCDCG 1998. LNCS, vol. 1763, pp. 194–200. Springer, Heidelberg (2000)
Peeters, R.: On coloring j-unit sphere graphs. Tech. rep., Department of Economics, Tilburg University (1991)
Raghavan, V., Spinrad, J.: Robust algorithms for restricted domains. Journal of Algorithms 48(1), 160–172 (2003)
Wang, D., Kuo, Y.-S.: A study on two geometric location problems. Information Processing Letters 28, 281–286 (1988)
Tsai, Y.-T., Lin, Y.-L., Hsu, F.R.: The online firstfit algorithm for radio frequency assignment problems. Information Processing Letters 84(4), 195–199 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fishkin, A.V. (2004). Disk Graphs: A Short Survey. In: Solis-Oba, R., Jansen, K. (eds) Approximation and Online Algorithms. WAOA 2003. Lecture Notes in Computer Science, vol 2909. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24592-6_23
Download citation
DOI: https://doi.org/10.1007/978-3-540-24592-6_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21079-5
Online ISBN: 978-3-540-24592-6
eBook Packages: Springer Book Archive