Unit disk graph recognition is NP-hard

Computational Geometry: Theory and Applications

Volumn 9, Issue 1-2, 1998, Pages 3-24

  Breu, Heinz ^a   Kirkpatrick, David G ^a  

^a UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

Disk intersection graphs; Disk touching graphs; NP hard; Sphericity

Indexed keywords

EID: 0013173620     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-7721(97)00014-X     Document Type: Article

References (17)

1. K.S. Booth, G.S. Luecker, Testing for the consecutive ones property, interval graphs and graph planarity using PQ-tree algorithms, J. Comput. System Sci. 13 (1976) 335-379.
2. H. Breu, D.G. Kirkpatrick, On the complexity of recognizing intersection and touching graphs of disks, in: Proc. Graph Drawing '95 (Passau, 1995), Lecture Notes in Computer Science 1027, Springer, Berlin, 1996, pp. 88-98.
3. B.N. Clark, C.J. Colbourn, D.S. Johnson, Unit disk graphs, Discrete Math. 86 (1/3) (1990) 165-177.
4. S.A. Cook, The complexity of theorem-proving procedures, in: Proceedings of the Third Annual Symposium on Theory of Computing, ACM, New York, 1971, pp. 151-158.
5. P.C. Fishburn, On the sphericity and cubicity of graphs, J. Combin. Theory Ser. B 35 (1983) 309-318.
6. D.R. Fulkerson, O.A. Gross, Incidence matrices and interval graphs, Pacific J. Math. 15 (3) (1965) 835-855.
7. M.R. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, New York, 1979.
8. W.K. Hale, Frequency assignment: theory and applications, Proc. IEEE 68 (12) (1980) 1497-1514.
9. T.F. Havel, The combinatorial distance geometry approach to the calculation of molecular conformation, Ph.D. Thesis, University of California, Berkeley, 1982.
10. T.F. Havel, The combinatorial distance geometry approach to the calculation of molecular conformation, Congr. Numer. 35 (4) (1982) 361-371.
11. T.F. Havel, I.D. Kuntz, G.M. Crippen, The combinatorial distance geometry method for the calculation of molecular conformation, I. A new approach to an old problem, J. Theor. Biol. 35 (4) (1983) 359-381.
12. D.S. Johnson, C.A. Aragon, L.A. McGeogh, C. Schevon, Optimization by simulated annealing: an experimental evaluation. Part II. Graph coloring and number partioning, Oper. Res. 39 (3) (1991) 378-406.
13. J. Kratochvil, Personal communication, February 1995.
14. M.V. Marathe, H.B. Hunt III, S.S. Ravi, Geometry based approximations for intersection graphs, in: Fourth Canadian Conference on Computational Geometry, 10-14 August 1992, pp. 244-249.
15. F.S. Roberts, Indifference graphs, in: Proof Techniques in Graph Theory (Proc. of the Second Ann Arbor Graph Theory Conference), Academic Press, New York, 1968, pp. 139-146.
16. F.S. Roberts, Quo vadis, graph theory, Technical Report 91-33, DIMACS, May 1991.
17. H. Sachs, Coin graphs, polyhedra, and conformal mapping, Discrete Math. 134 (1994) 133-138.