Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Algorithms

SIGAL 1990: Algorithms pp 53–65Cite as

20-Relative neighborhood graphs are Hamiltonian

  • Conference paper
  • First Online:

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

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Reference

  1. 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, J. and Nevalainen, O., "Computing Relative Neighborhood Graphs in the Plane," Pattern Recogn. 19 (1986), 221–228.

    Google Scholar 

  3. Toussaint, G. T., "The Relative Neighborhood Graph of a Finite Planar Set," Pattern Recong. 12 (1980), 261–268.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Computer Science and Information Engineering, National Chung Cheng University, Chiayi, Taiwan, R. O. C.

    Maw Shang Chang

  2. Institute of Computer Science, National Tsing Hua University, Hsinchu, Taiwan, R. O. C.

    C. Y. Tang

  3. Hsinchu and Academic Sinica, National Tsing Hua University, Taipei, Taiwan, Republic of China

    R. C. T. Lee

Authors
  1. Maw Shang Chang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. C. Y. Tang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. R. C. T. Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Tetsuo Asano Toshihide Ibaraki Hiroshi Imai Takao Nishizeki

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chang, M.S., Tang, C.Y., Lee, R.C.T. (1990). 20-Relative neighborhood graphs are Hamiltonian. In: Asano, T., Ibaraki, T., Imai, H., Nishizeki, T. (eds) Algorithms. SIGAL 1990. Lecture Notes in Computer Science, vol 450. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-52921-7_55

Download citation

  • DOI: https://doi.org/10.1007/3-540-52921-7_55

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-47177-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation