Maximum independent set and maximum clique algorithms for overlap graphs

We give polynomial time algorithms for the maximum independent set and maximum clique problems for classes of overlap graphs, assuming an overlap model is provided as input. The independent set algorithm applies to any class of overlap graphs for which the maximum weight independent set problem is polynomially solvable on the corresponding intersection graph class, where the vertex weights are nonnegative integers on which arithmetic operations can be performed in constant time. The maximum clique algorithm requires only that the overlap model satisfy the Helly property. In both cases, the size of the overlap model must be bounded by a polynomial in the size of the graph. The conditions for both algorithms are satisfied by the class of overlap graphs of subtrees in a tree, which contains chordal graphs, circle graphs, circular-arc graphs, cocomparability graphs, and polygon-circle graphs.

[1]  Edward Szpilrajn-Marczewski.  Sur deux propriétés des classes d'ensembles , 1945 .

[2]  A. Brandstädt,et al.  Graph Classes: A Survey , 1987 .

[3]  D. W. Wang,et al.  A Study on Two Geometric Location Problems , 1988, Information Processing Letters.

[4]  Sumio Masuda,et al.  Polynomial time algorithms on circular-arc overlap graphs , 1991, Networks.

[5]  Edward R. Scheinerman.  Characterizing intersection classes of graphs , 1985, Discret. Math..

[6]  Bruno Leclerc,et al.  Arbres et dimension des ordres , 1976, Discret. Math..

[7]  Fanica Gavril,et al.  Algorithms for a maximum clique and a maximum independent set of a circle graph , 1973, Networks.

[8]  Alexandr V. Kostochka,et al.  Covering and coloring polygon-circle graphs , 1997, Discret. Math..

[9]  M. Koebe.  Colouring of Spider Graphs , 1990 .

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

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

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

[13]  M. V. Nirkhe.  Efficient Algorithms for Circular-Arc Containment Graphs , 1987 .

[14]  Manfred Koebe.  On a New Class of Intersection Graphs , 1992 .

[15]  M. Middendorf,et al.  The max clique problem in classes of string-graphs , 1992, Discret. Math..

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

[17]  Fanica Gavril,et al.  Maximum weight independent sets and cliques in intersection graphs of filaments , 2000, Inf. Process. Lett..

[18]  M. Golumbic.  Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57) , 2004 .

[19]  Katsuto Nakajima,et al.  On rectangle intersection and overlap graphs , 1995 .

[20]  Eowyn W. Čenek.  Subtree overlap graphs and the maximum independent set problem , 1998 .