Advertisement

20-Relative neighborhood graphs are Hamiltonian

  • Maw Shang Chang
  • C. Y. Tang
  • R. C. T. Lee
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 450)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Reference

  1. [Garey and Johnson 1979]
    Garey, M. R. and Johnson, D. S., Computers and Intractability: A Guide to the Theory of NP—Completeness, Freeman, San Francisco, CA, 1979.Google Scholar
  2. [Katajainen and Nevalainen 1986]
    Katajainen, J. and Nevalainen, O., "Computing Relative Neighborhood Graphs in the Plane," Pattern Recogn. 19 (1986), 221–228.Google Scholar
  3. [Toussaint 1980]
    Toussaint, G. T., "The Relative Neighborhood Graph of a Finite Planar Set," Pattern Recong. 12 (1980), 261–268.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1990

Authors and Affiliations

  • Maw Shang Chang
    • 1
  • C. Y. Tang
    • 2
  • R. C. T. Lee
    • 3
  1. 1.Institute of Computer Science and Information EngineeringNational Chung Cheng UniversityChiayiTaiwan, R. O. C.
  2. 2.Institute of Computer ScienceNational Tsing Hua UniversityHsinchuTaiwan, R. O. C.
  3. 3.Hsinchu and Academic SinicaNational Tsing Hua UniversityTaipeiTaiwan, Republic of China

Personalised recommendations