Discrete realizations of contact and intersection graphs (extended abstract)

  • Jurek Czyzowicz
  • Evangelos Kranakis
  • Danny Krizanc
  • Jorge Urrutia
Packing, Compressing, and Touching
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1353)

Abstract

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.

1980 Mathematics Subject Classification

681110 68U05 

CR Categories

F.2.2 

Key Words and Phrases

Coin Contact Intersection Interval graphs Discrete Planar graphs NP 

References

  1. 1.
    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.Google Scholar
  2. 2.
    S. N. Bhatt and S. S. Cosmadakis, “The Complexity of Minimizing Wire Lengths in VLSI Layouts”, Information Processing Letters 25 (1987) 263–267.CrossRefGoogle Scholar
  3. 3.
    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.Google Scholar
  4. 4.
    G. R. Brightwell, and E. R. Scheinerman, “Representation of Planar Graphs”, SIAM Journal on ???, Vol. 6, No. 2, pp. 214–229, May 1993.Google Scholar
  5. 5.
    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.CrossRefGoogle Scholar
  6. 6.
    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.CrossRefGoogle Scholar
  7. 7.
    H. de Fraysseix, P. Ossona de Mendez, and P. Rosenstiehl, “On Triangle Contact Graphs”, Combinatorics, Probability and Computing (1994) 3, 233–246.Google Scholar
  8. 8.
    D. R. Fulkerson and O. A. Gross, “Incidence Matrices and Interval Graphs”, Pacific Journal of Mathematics, 15, 835–855, 1985.Google Scholar
  9. 9.
    M. C. Golumbic, “Algorithmic Graph Theory and Perfect Graphs”, Academic Press, New York, 1980.Google Scholar
  10. 10.
    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.Google Scholar
  11. 11.
    Z. Miller and J. B. Orlin, “NP-Completeness for Minimizing Maximum Edge Length in Grid Embeddings”, Journal of Algorithms 6, 10–16 (1985).CrossRefGoogle Scholar
  12. 12.
    H. Sachs, “Coin Graphs, Polyhedra, and Conformal Mapping”, Discrete Mathematics 134 (1994) 133–138.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag 1997

Authors and Affiliations

  • Jurek Czyzowicz
    • 1
  • Evangelos Kranakis
    • 2
  • Danny Krizanc
    • 2
  • Jorge Urrutia
    • 3
  1. 1.Département d'InformatiqueUniversité du Québec à HullHullCanada
  2. 2.School of Computer ScienceCarleton UniversityOttawaCanada
  3. 3.Department of Computer ScienceUniversity of OttawaOttawaCanada

Personalised recommendations