Algorithmic aspects of intersection graphs and representation hypergraphs

  title={Algorithmic aspects of intersection graphs and representation hypergraphs},
  author={Martin Charles Golumbic},
  journal={Graphs and Combinatorics},
  • M. Golumbic
  • Published 1 December 1988
  • Mathematics
  • Graphs and Combinatorics
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… 

Graph clustering: complexity, sequential and parallel algorithms

It is proved that the problem of partitioning the vertices of a graph into subgraphs of bounded diameter is NP-complete on bipartite and chordal graphs and an e cient parallel algorithm is presented for solving this problem on a class of unit interval graphs.

Approximation Algorithms for Intersection Graphs

The similarity to chordal graphs is used to construct simple polynomial-time approximation algorithms with constant approximation ratio for many NP-hard problems, when restricted to graphs for which at least one of the three complexity parameters is bounded by a constant.

Difference graphs

Trapezoid graphs and their coloring

Stability in Circular Arc Graphs

Complexity and Algorithms for Graph and Hypergraph Sandwich Problems

The NP-completeness of the Interval HSP and the Circular-arc HSP is proved and the k-tree graph sandwich problem is studied and the general problem is shown to be NP-complete and the fixed k version is given a polynomial algorithm.

Set Graphs. III. Proof Pearl: Claw-Free Graphs Mirrored into Transitive Hereditarily Finite Sets

It is proved formally that every connected claw-free graph admits (1) a near-perfect matching, (2) Hamiltonian cycles in its square.

Be sparse! Be dense! Be robust!: elements of parameterized algorithmics

It is shown that SUBSET INTERCONNECTION DESIGN admits a fixed-parameter algorithm with respect to the number of hyperedges in the input hypergraph, and Motivated by applications in network design, this thesis studies SUBSet INTER CONNECTIONDESIGN, where the support shall contain at most an integer f and the solution graphs shall have a certain property specific to the problem.

Dually Chordal Graphs

Recently in several papers ([10],[22],[42]) independently graphs with maximum neighbourhood orderings were characterized and turned out to be algorithmically useful.



Intersection graphs of paths in a tree

Interval graphs and related topics

Edge and vertex intersection of paths in a tree

The edge intersection graphs of paths in a tree

Counting interval graphs

In this paper we enumerate interval graphs (up to isomorphism) along with labelled interval graphs, identity interval graphs, transitive interval graphs and various sorts of unit interval graphs. The

Chronological orderings of interval graphs

A Characterization of Comparability Graphs and of Interval Graphs

Let < be a non-reflexive partial ordering defined on a set P. Let G(P, <) be the undirected graph whose vertices are the elements of P, and whose edges (a, b) connect vertices for which either a < b

Transitive Orientation of Graphs and Identification of Permutation Graphs

The graphs considered in this paper are assumed to be finite, with no edge joining a vertex to itself and with no two distinct edges joining the same pair of vertices. An undirected graph will be