Skip to main content
SpringerLink
Log in

Nearest neighbour graph realizability is NP-hard

  • Conference paper
  • First Online:
LATIN '95: Theoretical Informatics (LATIN 1995)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 911))

Included in the following conference series:

Abstract

Nearest neighbour graphs are geometric graphs defined on point sets. They express certain proximity relations. This paper gives several ways to define these graphs (weak, strong, mutual and general nearest neighbour graphs) and shows, for each definition, that the problem of determining whether a given combinatorial graph can be realized as such a nearest neighbour graph is NP-hard.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. J. Jaromczyk and G. Toussaint. Relative Neighborhood Graphs and Their Neighbors, Proc. IEEE, v. 80, 1992, pp. 1502–1517.

    Article  Google Scholar 

  2. G. Toussaint. A Graph-theoretical Primal Sketch. In Computational Morphology, ed. G. Toussaint, Elsevier, 1988, pp. 229–260.

    Google Scholar 

  3. G. Di Battista and P. Eades and R. Tamassia and I. Tollis. Algorithms for Drawing Graphs: An Annotated Bibliography. To appear in Computational Geometry and Applications. Currently available from wilma.cs.brown.edu by ftp.

    Google Scholar 

  4. M. Dillencourt. Realizability of Delaunay Triangulations, Information Processing Letters, v. 38, 1990, pp. 283–287.

    Article  Google Scholar 

  5. A. Lubiw and N. Sleumer. Maximal Outerplanar Graphs are Relative Neighbourhood Graphs. In Proceedings of the Canadian Conference on Computational Geometry, 1993, pp. 198–203.

    Google Scholar 

  6. P. Bose and W. Lenhart and G. Liotta. Characterizing Proximity Trees. In Graph Drawing '93, 1993.

    Google Scholar 

  7. P. Eades and S. Whitesides. The Realization Problem for Euclidean Minimum Spanning Trees is NP-hard. In Proceedings of the 10th ACM Symposium on Computational Geometry, Stony Brook NY, 1994.

    Google Scholar 

  8. K. Sugiyama. A Readability Requirement on Drawing Digraphs: Level Assignment and Edge Removal for Reducing the Total Length of Lines. TR 45, International Institute for Advanced Study of Social Information Science, March, 1984.

    Google Scholar 

  9. P. J. Idicula. Drawing Trees in Grids. M.Sc. thesis, Computer Science, U. Auckland, 1990.

    Google Scholar 

  10. A. Gregori. Unit Length Embedding of Binary Trees on a Square Grid, Information Processing Letters, v. 31, 1989, pp. 167–172.

    Article  Google Scholar 

  11. F. J. Brandenburg. Nice Drawings of Graphs and Trees are Computationally Hard. TR MIP-8820, U. of Passau, 1988.

    Google Scholar 

  12. S. Bhatt and S. Cosmodakis. The Complexity of Minimizing Wire Lengths in VLSI Layouts. Information Processing Letters v. 25, 1987, pp. 263–267.

    Article  Google Scholar 

  13. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, San Francisco, 1979.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Newcastle, University Drive, 2308, Callaghan, NSW, Australia

    Peter Eades

  2. School of Computer Science, McGill University, 3480 University St. #318, H3A 2A7, Montreal, Quebec, Canada

    Sue Whitesides

Authors
  1. Peter Eades
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sue Whitesides
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Ricardo Baeza-Yates Eric Goles Patricio V. Poblete

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Eades, P., Whitesides, S. (1995). Nearest neighbour graph realizability is NP-hard. In: Baeza-Yates, R., Goles, E., Poblete, P.V. (eds) LATIN '95: Theoretical Informatics. LATIN 1995. Lecture Notes in Computer Science, vol 911. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-59175-3_93

Download citation

  • DOI: https://doi.org/10.1007/3-540-59175-3_93

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-59175-7

  • Online ISBN: 978-3-540-49220-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation