Skip to main content
SpringerLink
Log in

Algorithmic aspects of intersection graphs and representation hypergraphs

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

Let ℛ be a family of sets. The intersection graph of ℛ is obtained by representing each set in ℛ by a vertex and connecting two vertices by an edge if and only if their corresponding sets intersect. Of primary interest are those classes of intersection graphs of families of sets having some specific topological or other structure. The “grandfather” of all intersection graphs is the class of interval graphs, that is, the intersection graphs of intervals on a line.

The scope of research that has been going on in this general area extends from the mathematical and algorithmic properties of intersection graphs, to their generalizations and graph parameters motivated by them. In addition, many real-world applications involve the solution of problems on such graphs.

In this paper a number of topics in algorithmic combinatorics which involve intersection graphs and their representative families of sets are presented. Recent applications to computer science are also discussed. The intention of this presentation is to provide an understanding of the main research directions which have been investigated and to suggest possible new directions of research.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Beeri, C., Fagin, R., Maier, D., Yannakakis, M.: On the desirability of acyclic database schemes, J. Assoc. Comput. Mach.30, 479–513 (1983)

    Google Scholar 

  2. Benser, S.: On the topology of the genetic fine structure, Proc. Natl. Acad. Sci. USA45, 1607–1620 (1959)

    Google Scholar 

  3. Berge, C.: Graphs and Hypergraphs. Amsterdam: North-Holland 1973

    Google Scholar 

  4. Booth, K.S., Lueker, G.S.: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms. J. Comput. Syst. Sci.13, 335–379 (1976)

    Google Scholar 

  5. Bouchet, A.: Un algorithme polynomial pour reconnaître les graphes d'alternance. C. R. Acad. Sci. Paris Ser. I Math300, 569–572 (1985)

    Google Scholar 

  6. Buneman, P.: A characterization of rigid circuit graphs. Discrete Math.9, 205–212 (1974)

    Google Scholar 

  7. Cohen, Joel E.: The asymptotic probability that a random graph is a unit interval graph, indifference graph, or proper interval graph. Discrete Math.40, 21–24 (1982)

    Google Scholar 

  8. Duchet, P.: Propriété de Helly et problèmes de représentation, Colloq. Internat. CNRS 260, Problèmes Combinatoires et Théorie des Graphes, Orsay, France, 117–118 (1976)

    Google Scholar 

  9. Duchet, P.: Representations, noyaux, en théorie des graphes et hypergraphs. Doctoral Thesis, Univ. Paris VI, 1979

  10. Duchet, P.: Classical perfect graphs. Ann. Discrete Math.21, 67–96 (1984)

    Google Scholar 

  11. Dushnik, B., Miller, E.W.: Partially ordered sets. Amer. J. Math.63, 600–610 (1941)

    Google Scholar 

  12. Even, S., Pnueli, A., Lempel, A.: Permutation graphs and transitive graphs. J. Assoc. Comput. Mach.19, 400–410 (1972)

    Google Scholar 

  13. Fabri, J.: Automatic storage optimization. Ann Arbor, MI: UMI Press 1982

    Google Scholar 

  14. Fagin, R.: Degrees of acyclicity for hypergraphs and relational database schemes. J. Assoc. Comput. Mach.30, 514–550 (1983)

    Google Scholar 

  15. Fagin, R.: Acyclic database schemes of various degrees: a painless introduction. In: Lecture Notes in Computer Science 159. pp. 65–89. Berlin: Springer-Verlag 1983

    Google Scholar 

  16. Fishburn, P.C.: Interval Orders and Interval Graphs. New York: Wiley 1985

    Google Scholar 

  17. Flament, C.: Hypergraphes arborés. Discrete Math.21, 223–226 (1978)

    Google Scholar 

  18. Fournier, J.C.: Hypergraphes de chaines d'arêtes d'un arbre. Discrete Math.43, 29–36 (1983)

    Google Scholar 

  19. Fulkerson, D.R., Gross, O.A.: Incidence matrices and interval graphs.Pacific J. Math. 15, 835–855 (1965)

    Google Scholar 

  20. Gabor, C.P., Hsu, W.-L., Supowit, K.J.: Recognizing circle graphs in polynomial time. Proc. IEEE Symp. on Foundations of Computer Science. (1985)

  21. Garey, M.R., Johnson, D.S., Miller, G.L., Papadimitriou, C.H.: The complexity of coloring circular arcs and chords. SIAM J. Algebraic Discrete Methods1, 216–227 (1980)

    Google Scholar 

  22. Gattass, E.A., Nemhauser, G.L.: An application of vertex packing to data analysis in the evaluation of pavement deterioration. Oper. Res. Letters1, 13–17 (1981)

    Google Scholar 

  23. Gavril, F.: Algorithms on circular arc graphs. Networks4, 357–369 (1974)

    Google Scholar 

  24. Gavril, F.: The intersection graphs of subtrees of a tree are exactly the chordal graphs. J. Comb. Theory (B)16, 47–56 (1974)

    Google Scholar 

  25. Gavril, F.: A recognition algorithm for the intersection graphs of paths in trees. Discrete Math.23, 211–227 (1978)

    Google Scholar 

  26. Gavril, F., Tamari, R.: Constructing edge-trees from hypergraphs. Networks13, 377–388 (1983)

    Google Scholar 

  27. Ghosh, S.P., Kambayaski, Y., Lipski, W. Jr.: Data Base File Organization: Theory and Applications of the Consecutive Retrieval Property. New York: Academic Press 1983

    Google Scholar 

  28. Gilmore, P.C., Hoffman, A.J.: A characterization of comparability graphs and of interval graphs. Canad. J. Math.16, 539–548 (1964)

    Google Scholar 

  29. Golumbic, M.C.: Comparability graphs and a new matroid, J. Comb. Theory (B)22, 68–90 (1977)

    Google Scholar 

  30. Golumbic, M.C.: A note on perfect Gaussian elimination. J. Math. Anal. Appl.64, 455–457 (1978)

    Google Scholar 

  31. Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. New York: Academic Press 1980

    Google Scholar 

  32. Golumbic, M.C.: Algorithmic aspects of perfect graphs. Ann. Discrete Math.21, 301–323 (1984)

    Google Scholar 

  33. Golumbic, M.C.: Interval Graphs and Related Topics, A special issue of Discrete Math.55, 113–243 (1985)

    Google Scholar 

  34. Golumbic, M.C., Goss, C.F., Dewar, R.B.K.: Macro substitutions in MICRO SPITBOL — a combinatorial analysis (Proc. 11th Southeastern Conf. on Combinatorics, Graph Theory and Computing) Congr. Numerantium 29, 485–495 (1980)

    Google Scholar 

  35. Golumbic, M.C., Hammer, P.L.: Stability in circular arc graphs J. Algorithms (to appear 1988).

  36. Golumbic, M.C., Jamison, R.E.: The edge intersection graphs of paths in a tree. J. Comb. Theory (B)38, 8–22 (1985)

    Google Scholar 

  37. Golumbic, M.C., Jamison, R.E.: Edge and vertex intersection of paths in a tree. Discrete Math.55, 151–159 (1985)

    Google Scholar 

  38. Golumbic, M.C., Monma, C.L.: A generalization of interval graphs with tolerances (Proc. 13th Southeastern Conf. on Combinatorics, Graph Theory and Computing). Congr. Numerantium 35, 321–331 (1982)

    Google Scholar 

  39. Golumbic, M.C., Monma, C.L., Trotter, W.T., Jr.: Tolerance graphs. Discrete Appl. Math.9, 157–170 (1984)

    Google Scholar 

  40. Golumbic, M.C., Rotem, D., Urrutia, J.: Comparability graphs and intersection graphs. Discrete Math.43, 37–46 (1983)

    Google Scholar 

  41. Golumbic, M.C., Scheinerman, E.R.: Containment graphs, posets and related classes of graphs. (Proc. Third Int'l Conf. on Combinatorial Math., New York, June 1985) Ann. N. Y. Acad. Sci. (to appear 1988).

  42. Goodman, N., Shmueli, O.: Syntactic characterization of tree database schemes. J. Assoc. Comput. Mach.30, 767–786 (1983)

    Google Scholar 

  43. Gupta, U.I., Lee, D.T., Leung, J.Y.-T.: Efficient algorithms for interval graphs and circular arc graphs. Networks12, 459–467 (1982)

    Google Scholar 

  44. Hanlon, P.: Counting interval graphs. Trans. Amer. Math. Soc.272, 383–426 (1982)

    Google Scholar 

  45. Hsu, W.-L.: Maximum weight clique algorithm for circular arc graphs and circle graphs. SIAM J. Computing14, 224–231 (1985)

    Google Scholar 

  46. Jungck, J.R., Dick, G., Dick, A.G.: Computer-assisted sequencing, interval graphs, and molecular evolution. Biosystems15, 259–273 (1982)

    Google Scholar 

  47. Klee, V.: What are the intersection graphs of arcs in a circle? Amer. Math. Mon.76, 810–813 (1969)

    Google Scholar 

  48. LaPaugh, A.S.: A polynomial time algorithm for optimal routing around a rectangle. In: Proc. IEEE Symp. on Foundations of Computer Science. pp. 282–293 1980

  49. Leung, J.Y.-T.: Fast algorithms for generating all maximal independent sets of interval, circular-arc and chordal graphs. J. Algorithms5, 22–35 (1984)

    Google Scholar 

  50. Lustig, A., Shmueli, O.: Acyclic hypergraph projections and relationships to circular-arc graphs and circular representable hypergraphs. Technion — Israel Institute of Technology, Technical Report, Nov. 1985

  51. Maier, D.: The Theory of Relational Databases. Rockville, MD: Computer Science Press 1983

    Google Scholar 

  52. Monma, C.L.: Intersection graphs of paths in trees. J. Comb. Theory (B)41, 141–181 (1987)

    Google Scholar 

  53. Opsut, R.J., Roberts, F.S.:I-colorings,I-phasings, andI-intersection assignments for graphs, and their applications. Networks13, 327–345 (1983)

    Google Scholar 

  54. Orlin, J., Bonuccelli, M., Bovet, D.: AnO(n2) algorithm for coloring proper circular arc graphs. SIAM J. Algebraic Discrete Methods2, 88–93 (1981)

    Google Scholar 

  55. Pnueli, A., Lempel, A., Even, S.: Transitive orientation of graphs and identification of permutation graphs. Canad. J. Math.23, 160–175 (1971)

    Google Scholar 

  56. Preparata, F.P., Shamos, Michael I.: Computational Geometry. New York: Springer-Verlag 1985

    Google Scholar 

  57. Quilliot, A.: Circular representation problems on hypergraphs. Discrete Math.51, 251–264 (1984)

    Google Scholar 

  58. Roberts, F.S.: Discrete Mathematical Models with Applications to Social, Biological and Environmental Problems. Englewood Cliffs, NJ: Prentice-Hall 1976

    Google Scholar 

  59. Rose, D.J.: Triangulated graphs and the elimination process. J. Math. Anal. Appl.32, 597–609 (1970)

    Google Scholar 

  60. Rose, D.J.: Tarjan, R.E., Lueker, G.S.: Algorithmic aspects of vertex elimination on graphs. SIAM J. Comput.5 266–283 (1976)

    Google Scholar 

  61. Skrien, D.J.: Chronological orderings of interval graphs. Discrete Applied Math.8, 69–83 (1984)

    Google Scholar 

  62. Spinrad, J.: On comparability and permutation graphs. SIAM J. Computing14, 658–670 (1985)

    Google Scholar 

  63. Tarjan, R. E., Yannakakis, M.: Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs. SIAM J. Computing13, 566–579 (1984)

    Google Scholar 

  64. Teng, A., Tucker, A.C.: AnO(qn) algorithm toq-color a proper family of circular arcs. Discrete Math.55, 233–243 (1985)

    Google Scholar 

  65. Trotter, W.T., Jr., Moore, J.I., Jr., Summer, D.P.: The dimension of a comparability graph. Proc. Amer. Math. Soc.60, 35–38 (1976)

    Google Scholar 

  66. Tucker, A.C.: Characterizing circular arc graphs. Bull. Amer. Math. Soc.76, 1257–1260 (1970)

    Google Scholar 

  67. Tucker, A.C.: Matrix characterizations of circular arc graphs. Pacific J. Math.39, 535–545 (1971)

    Google Scholar 

  68. Tucker, A.C.: Structure theorems for some circular arc graphs. Discrete Math.7, 167–195 (1974)

    Google Scholar 

  69. Tucker, A.C.: Coloring a family of circular arc graphs. SIAM J. Appl. Math.29, 493–502 (1975)

    Google Scholar 

  70. Tucker, A.C.: An efficient test for circular arc graphs. SIAM J. Computing9, 1–24 (1980)

    Google Scholar 

  71. Tutte, W.T.: An algorithm for determining whether a given binary matroid is graphic. Proc. Amer. Math. Soc.11, 905–917 (1960)

    Google Scholar 

  72. Walter, J.R.: Representations of rigid cycle graphs. Doctoral dissertation, Wayne State Univ., 1972.

  73. Yannakakis, M.: The complexity of the partial order dimension problem. SIAM J. Algebraic Discrete Methods3, 351–358 (1982)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IBM Israel Scientific Center, Haifa, Israel

    Martin Charles Golumbic

Authors
  1. Martin Charles Golumbic
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Golumbic, M.C. Algorithmic aspects of intersection graphs and representation hypergraphs. Graphs and Combinatorics 4, 307–321 (1988). https://doi.org/10.1007/BF01864170

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01864170

Keywords

Search

Navigation