Discrete realizations of contact and intersection graphs (extended abstract)
Purchase on Springer.com
$29.95 / €24.95 / £19.95*
* Final gross prices may vary according to local VAT.
Known realizations of geometric representations of graphs, like contact, intersection, etc., are “continuous”, in the sense that the geometric objects are drawn in Euclidean space with real numbers as coordinates. In this paper, we initiate the study of dicrete versions of contact and intersection graphs and examine their relation to their continuous counterparts. The classes of graphs arising appear to have interesting properties and are thus interesting in their own right. We also study realizability, characterizations as well as intractability questions for the resulting new classes of graphs.
- S. Abramowski, B. Lang, and H. Miller, “Moving Regular k-gons in Contact”, In proceedings of International Workshop WG'88 on Graph-Theoretic Concepts in Computer Science, Jan van Leewen, editor, Springer Verlag Lecture Notes in Computer Science, vol. 344, pp. 229–242, 1989.
- S. N. Bhatt and S. S. Cosmadakis, “The Complexity of Minimizing Wire Lengths in VLSI Layouts”, Information Processing Letters 25 (1987) 263–267. CrossRef
- H. Breu and D. G. Kirkpatrick, “On the Complexity of Recognizing Intersection and Touching Graphs of Disks”, In proceedings of Graph Drawing 95, pp. 88–98. Springer Verlag Lecture Notes in Computer Science.
- G. R. Brightwell, and E. R. Scheinerman, “Representation of Planar Graphs”, SIAM Journal on ???, Vol. 6, No. 2, pp. 214–229, May 1993.
- D. G. Corneil, H. Kim, S. Natarajan, S. Olariu, and A. P. Sprague, “Simple Linear Time Recognition of Unit Interval Graphs”, Information Processing Letters 55 (1995) 99–104. CrossRef
- C. M. Herrera de Figueiredo, J. Meidanis, C. Picinin de Mello, “A Linear-Time Alforithm for Proper Interval Graph Recognition”, Information Processing Letters 56 (1995) 179–184. CrossRef
- H. de Fraysseix, P. Ossona de Mendez, and P. Rosenstiehl, “On Triangle Contact Graphs”, Combinatorics, Probability and Computing (1994) 3, 233–246.
- D. R. Fulkerson and O. A. Gross, “Incidence Matrices and Interval Graphs”, Pacific Journal of Mathematics, 15, 835–855, 1985.
- M. C. Golumbic, “Algorithmic Graph Theory and Perfect Graphs”, Academic Press, New York, 1980.
- N. Korte and R. H. Möhring, “A Simple Linear-Time Algorithm to Recognize Interval Graphs”, In proceedings of International Workshop WG'86 on Graph-Theoretic Concepts in Computer Science, G. Tinhofer and G. Schmidt, editors, Springer Verlag Lecture Notes in Computer Science, vol. 246, 1987.
- Z. Miller and J. B. Orlin, “NP-Completeness for Minimizing Maximum Edge Length in Grid Embeddings”, Journal of Algorithms 6, 10–16 (1985). CrossRef
- H. Sachs, “Coin Graphs, Polyhedra, and Conformal Mapping”, Discrete Mathematics 134 (1994) 133–138. CrossRef
- Discrete realizations of contact and intersection graphs (extended abstract)
- Book Title
- Graph Drawing
- Book Subtitle
- 5th International Symposium, GD '97 Rome, Italy, September 18–20, 1997 Proceedings
- pp 359-370
- Print ISBN
- Online ISBN
- Series Title
- Lecture Notes in Computer Science
- Series Volume
- Series ISSN
- Springer Berlin Heidelberg
- Copyright Holder
- Additional Links
- Interval graphs
- Planar graphs
- Industry Sectors
- eBook Packages
- Author Affiliations
- 1. Département d'Informatique, Université du Québec à Hull, J8X 3X7, Hull, Québec, Canada
- 2. School of Computer Science, Carleton University, K1S 5B6, Ottawa, ON, Canada
- 3. Department of Computer Science, University of Ottawa, K1N 9B4, Ottawa, ON, Canada
To view the rest of this content please follow the download PDF link above.