The number of flips required to obtain non-crossing convex cycles

Yoshiaki Oda, Mamoru Watanabe

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

In this paper, we consider Hamiltonian cycles of vertices in convex position on the plane, where, in general, these cycles contain crossing edges. We give several results concerning the minimum number of operations that delete two crossing edges, add two other edges and preserve hamiltonicity in transforming these cycles to non-crossing Hamiltonian cycles.

Original languageEnglish
Title of host publicationComputational Geometry and Graph Theory - International Conference, KyotoCGGT 2007, Revised Selected Papers
Pages155-165
Number of pages11
DOIs
Publication statusPublished - 2008 Dec 1
EventInternational Conference on Computational Geometry and Graph Theory, KyotoCGGT 2007 - Kyoto, Japan
Duration: 2007 Jun 112007 Jun 15

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4535 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

OtherInternational Conference on Computational Geometry and Graph Theory, KyotoCGGT 2007
CountryJapan
CityKyoto
Period07/6/1107/6/15

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'The number of flips required to obtain non-crossing convex cycles'. Together they form a unique fingerprint.

  • Cite this

    Oda, Y., & Watanabe, M. (2008). The number of flips required to obtain non-crossing convex cycles. In Computational Geometry and Graph Theory - International Conference, KyotoCGGT 2007, Revised Selected Papers (pp. 155-165). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4535 LNCS). https://doi.org/10.1007/978-3-540-89550-3-17