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 publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages155-165
Number of pages11
Volume4535 LNCS
DOIs
Publication statusPublished - 2008
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)03029743
ISSN (Electronic)16113349

Other

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

Fingerprint

Hamiltonians
Hamiltonian circuit
Flip
Cycle
Hamiltonicity

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Oda, Y., & Watanabe, M. (2008). The number of flips required to obtain non-crossing convex cycles. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4535 LNCS, 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

The number of flips required to obtain non-crossing convex cycles. / Oda, Yoshiaki; Watanabe, Mamoru.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4535 LNCS 2008. p. 155-165 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4535 LNCS).

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

Oda, Y & Watanabe, M 2008, The number of flips required to obtain non-crossing convex cycles. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 4535 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4535 LNCS, pp. 155-165, International Conference on Computational Geometry and Graph Theory, KyotoCGGT 2007, Kyoto, Japan, 07/6/11. https://doi.org/10.1007/978-3-540-89550-3-17
Oda Y, Watanabe M. The number of flips required to obtain non-crossing convex cycles. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4535 LNCS. 2008. p. 155-165. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-540-89550-3-17
Oda, Yoshiaki ; Watanabe, Mamoru. / The number of flips required to obtain non-crossing convex cycles. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4535 LNCS 2008. pp. 155-165 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{487281d673fc4916955ccfdb965bbff1,
title = "The number of flips required to obtain non-crossing convex cycles",
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.",
author = "Yoshiaki Oda and Mamoru Watanabe",
year = "2008",
doi = "10.1007/978-3-540-89550-3-17",
language = "English",
isbn = "3540895493",
volume = "4535 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "155--165",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

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

AU - Oda, Yoshiaki

AU - Watanabe, Mamoru

PY - 2008

Y1 - 2008

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=70349897671&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=70349897671&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-89550-3-17

DO - 10.1007/978-3-540-89550-3-17

M3 - Conference contribution

AN - SCOPUS:70349897671

SN - 3540895493

SN - 9783540895497

VL - 4535 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 155

EP - 165

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -