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

Yoshiaki Oda; Mamoru Watanabe

doi:10.1007/978-3-540-89550-3_17

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

Yoshiaki Oda, Mamoru Watanabe

Department of Mathematics

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

5 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 language	English
Title of host publication	Computational Geometry and Graph Theory - International Conference, KyotoCGGT 2007, Revised Selected Papers
Publisher	Springer Verlag
Pages	155-165
Number of pages	11
ISBN (Print)	3540895493, 9783540895497
DOIs	https://doi.org/10.1007/978-3-540-89550-3_17
Publication status	Published - 2008
Event	International Conference on Computational Geometry and Graph Theory, KyotoCGGT 2007 - Kyoto, Japan Duration: 2007 Jun 11 → 2007 Jun 15

Publication series

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

Other

Other	International Conference on Computational Geometry and Graph Theory, KyotoCGGT 2007
Country/Territory	Japan
City	Kyoto
Period	07/6/11 → 07/6/15

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/978-3-540-89550-3_17

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). Springer Verlag. 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.
Computational Geometry and Graph Theory - International Conference, KyotoCGGT 2007, Revised Selected Papers. Springer Verlag, 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 proceeding › Conference contribution

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. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4535 LNCS, Springer Verlag, 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 Computational Geometry and Graph Theory - International Conference, KyotoCGGT 2007, Revised Selected Papers. Springer Verlag. 2008. p. 155-165. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-540-89550-3_17

Oda, Yoshiaki ; Watanabe, Mamoru. / The number of flips required to obtain non-crossing convex cycles. Computational Geometry and Graph Theory - International Conference, KyotoCGGT 2007, Revised Selected Papers. Springer Verlag, 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",

note = "Copyright: Copyright 2021 Elsevier B.V., All rights reserved.; International Conference on Computational Geometry and Graph Theory, KyotoCGGT 2007 ; Conference date: 11-06-2007 Through 15-06-2007",

year = "2008",

doi = "10.1007/978-3-540-89550-3_17",

language = "English",

isbn = "3540895493",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "155--165",

booktitle = "Computational Geometry and Graph Theory - International Conference, KyotoCGGT 2007, Revised Selected Papers",

}

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

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

SP - 155

EP - 165

BT - Computational Geometry and Graph Theory - International Conference, KyotoCGGT 2007, Revised Selected Papers

PB - Springer Verlag

T2 - International Conference on Computational Geometry and Graph Theory, KyotoCGGT 2007

Y2 - 11 June 2007 through 15 June 2007

ER -

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

Abstract

Publication series

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this