On the Complexity of Recognizing Intersection and Touching Graphs of Disks

Disk intersection (respectively, touching) graphs are the intersection graphs of closed disks in the plane whose interiors may (respectively, may not) overlap. In a previous paper [BK93], we showed that the recognition problem for unit disk intersection graphs (i.e. intersection graphs of unit disks) is NP-hard. That proof is easily modified to apply to unit disk touching graphs as well. In this paper, we show how to generalize our earlier construction to accomodate disks whose size may differ. In particular, we prove that the recognition problems for both bounded-ratio disk intersection graphs and bounded-ratio disk touching graphs are also NP-hard. (By bounded-ratio we refer to the natural generalization of the unit constraint in which the radius ratio of the largest to smallest permissible disk is bounded by some fixed constant.) The latter result contrasts with the fact that the disk touching graphs (of unconstrained ratio) are precisely the planar graphs, and are hence polynomial time recognizable. The recognition problem for disk intersection graphs (of unconstrained ratio) has recently been shown to be NP-hard as well [Kra95].

[1]  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..

[2]  Peter L. Hammer,et al.  Difference graphs , 1990, Discret. Appl. Math..

[3]  Achilleas Papakostas,et al.  On the Angular Resolution of Planar Graphs , 1994, SIAM J. Discret. Math..

[4]  Horst Sachs,et al.  Coin graphs, Polyhedra, and conformal mapping , 1994, Discret. Math..

[5]  W. K. Hale.  Frequency assignment: Theory and applications , 1980, Proceedings of the IEEE.

[6]  Jan Kratochvíl.  A Special Planar Satisfiability Problem and a Consequence of Its NP-completeness , 1994, Discret. Appl. Math..

[7]  Stavros S. Cosmadakis,et al.  The Complexity of Minimizing Wire Lengths in VLSI Layouts , 1987, Inf. Process. Lett..

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

[9]  Charles J. Colbourn,et al.  Unit disk graphs , 1991, Discret. Math..

[10]  David G. Kirkpatrick,et al.  Algorithmic aspects of constrained unit disk graphs , 1996 .

[11]  Seth M. Malitz,et al.  On the angular resolution of planar graphs , 1992, STOC '92.

[12]  N. Sloane,et al.  Proof Techniques in Graph Theory , 1970 .

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

[14]  Cecilia R. Aragon,et al.  Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning , 1991, Oper. Res..

[15]  John F. Canny,et al.  Some algebraic and geometric computations in PSPACE , 1988, STOC '88.

[16]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[17]  Jan Kratochvíl,et al.  String graphs. II. recognizing string graphs is NP-hard , 1991, J. Comb. Theory, Ser. B.

[18]  Peter C. Fishburn.  On the sphericity and cubicity of graphs , 1983, J. Comb. Theory, Ser. B.