Algorithmic aspects of intersection graphs and representation hypergraphs

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.

[1]  Robert E. Tarjan,et al.  Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs , 1984, SIAM J. Comput..

[2]  Wen-Lian Hsu,et al.  Maximum Weight Clique Algorithms for Circular-Arc Graphs and Circle Graphs , 1985, SIAM J. Comput..

[3]  Peter Buneman,et al.  A characterisation of rigid circuit graphs , 1974, Discret. Math..

[4]  Alan Tucker,et al.  Structure theorems for some circular-arc graphs , 1974, Discret. Math..

[5]  Catriel Beeri,et al.  On the Desirability of Acyclic Database Schemes , 1983, JACM.

[6]  P. Gilmore,et al.  A Characterization of Comparability Graphs and of Interval Graphs , 1964, Canadian Journal of Mathematics.

[7]  William T. Trotter,et al.  The dimension of a comparability graph , 1976 .

[8]  Claude Berge,et al.  Graphs and Hypergraphs , 2021, Clustering.

[9]  Jeremy P. Spinrad,et al.  On Comparability and Permutation Graphs , 1985, SIAM J. Comput..

[10]  A. Lempel,et al.  Transitive Orientation of Graphs and Identification of Permutation Graphs , 1971, Canadian Journal of Mathematics.

[11]  Gary L. Miller,et al.  The Complexity of Coloring Circular Arcs and Chords , 1980, SIAM J. Algebraic Discret. Methods.

[12]  Robert E. Tarjan,et al.  Algorithmic Aspects of Vertex Elimination on Graphs , 1976, SIAM J. Comput..

[13]  Peter L. Hammer,et al.  Stability in Circular Arc Graphs , 1988, J. Algorithms.

[14]  Ronald Fagin,et al.  Degrees of acyclicity for hypergraphs and relational database schemes , 1983, JACM.

[15]  Nathan Goodman,et al.  Syntactic Characterization of Tree Database Schemas , 1983, JACM.

[16]  Joseph Y.-T. Leung,et al.  Fast Algorithms for Generating All Maximal Independent Sets of Interval, Circular-Arc and Chordal Graphs , 1984, J. Algorithms.

[17]  D. Rose.  Triangulated graphs and the elimination process , 1970 .

[18]  Fanica Gavril,et al.  Algorithms on circular-arc graphs , 1974, Networks.

[19]  Martin Charles Golumbic,et al.  The edge intersection graphs of paths in a tree , 1985, J. Comb. Theory, Ser. B.

[20]  Martin Charles Golumbic.  Interval graphs and related topics , 1985, Discret. Math..

[21]  Dale Skrien.  Chronological orderings of interval graphs , 1984, Discret. Appl. Math..

[22]  Martin Charles Golumbic,et al.  A note on perfect Gaussian elimination , 1978 .

[23]  V. Klee.  What Are the Intersection Graphs of Arcs in a Circle , 1969 .

[24]  David Maier,et al.  The Theory of Relational Databases , 1983 .

[25]  Martin Charles Golumbic,et al.  Comparability graphs and a new matroid , 1977, J. Comb. Theory, Ser. B.

[26]  Alan Tucker,et al.  An O(qn) algorithm to q-color a proper family of circular arcs , 1985, Discret. Math..

[27]  Fred S. Roberts,et al.  I-Colorings, I-Phasings, and I-Intersection assignments for graphs, and their applications , 1983, Networks.

[28]  George L. Nemhauser,et al.  An application of vertex packing to data analysis in the evaluation of pavement deterioration , 1981, Oper. Res. Lett..

[29]  J.-C. Fournier.  Hypergraphes de chaines d'aretes d'un arbre , 1983, Discret. Math..

[30]  Fanica Gavril,et al.  An algorithm for constructing edge-trees from hypergraphs , 1983, Networks.

[31]  Fanica Gavril,et al.  A recognition algorithm for the intersection graphs of paths in trees , 1978, Discret. Math..

[32]  Jorge Urrutia,et al.  Comparability graphs and intersection graphs , 1983, Discret. Math..

[33]  Joel E. Cohen.  The asymptotic probability that a random graph is a unit interval graph, indifference graph, or proper interval graph , 1982, Discret. Math..

[34]  Andrea S. LaPaugh,et al.  A polynomial time algorithm for optimal routing around a rectangle , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[35]  Clyde L. Monma,et al.  Intersection graphs of paths in a tree , 1986, J. Comb. Theory, Ser. B.

[36]  W. T. Tutte.  An algorithm for determining whether a given binary matroid is graphic. , 1960 .

[37]  J R Jungck,et al.  Computer-assisted sequencing, interval graphs, and molecular evolution. , 1982, Bio Systems.

[38]  Martin Charles Golumbic.  Algorithmic Aspects of Perfect Graphs , 1984 .

[39]  F. Gavril.  The intersection graphs of subtrees in tree are exactly the chordal graphs , 1974 .

[40]  Amir Pnueli,et al.  Permutation Graphs and Transitive Graphs , 1972, JACM.

[41]  M. Golumbic.  Algorithmic graph theory and perfect graphs , 1980 .

[42]  D. P. Bovet,et al.  An $O(n^2 )$ Algorithm for Coloring Proper Circular Arc Graphs , 1981 .

[43]  Alan C. Tucker,et al.  An Efficient Test for Circular-Arc Graphs , 1980, SIAM J. Comput..

[44]  A. Tucker,et al.  Matrix characterizations of circular-arc graphs , 1971 .

[45]  M. Nivat,et al.  Un algorithme polynomial pour reconnaître les graphes d'alternance , 1985 .

[46]  P. Duchet.  Classical Perfect Graphs: An introduction with emphasis on triangulated and interval graphs , 1984 .

[47]  Joseph Y.-T. Leung,et al.  Efficient algorithms for interval graphs and circular-arc graphs , 1982, Networks.

[48]  S. Benzer.  ON THE TOPOLOGY OF THE GENETIC FINE STRUCTURE. , 1959, Proceedings of the National Academy of Sciences of the United States of America.

[49]  Martin Charles Golumbic,et al.  Edge and vertex intersection of paths in a tree , 1985, Discret. Math..

[50]  Wen-Lian Hsu,et al.  Recognizing circle graphs in polynomial time , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[51]  M. Yannakakis.  The Complexity of the Partial Order Dimension Problem , 1982 .

[52]  Clyde L. Monma,et al.  Tolerance graphs , 1984, Discret. Appl. Math..

[53]  Claude Flament,et al.  Hypergraphes arbores , 1978, Discret. Math..

[54]  Ben Dushnik,et al.  Partially Ordered Sets , 1941 .

[55]  A. Tucker,et al.  Coloring a Family of Circular Arcs , 1975 .

[56]  Alan Tucker,et al.  Characterizing circular-arc graphs , 1970 .

[57]  Kellogg S. Booth,et al.  Testing for the Consecutive Ones Property, Interval Graphs, and Graph Planarity Using PQ-Tree Algorithms , 1976, J. Comput. Syst. Sci..

[58]  D. R. Fulkerson,et al.  Incidence matrices and interval graphs , 1965 .

[59]  Alain Quilliot.  Circular representation problem on hypergraphs , 1984, Discret. Math..

[60]  F. Roberts.  Discrete Mathematical Models with Applications to Social, Biological, and Environmental Problems. , 1976 .

[61]  Ronald Fagin.  Acyclic Database Schemes (of Various Degrees): A Painless Introduction , 1983, CAAP.

[62]  P. Hanlon.  Counting interval graphs , 1982 .