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

Yoshiaki Oda, Mamoru Watanabe

研究成果: Conference contribution

2 被引用数 (Scopus)

抄録

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.

本文言語English
ホスト出版物のタイトルComputational Geometry and Graph Theory - International Conference, KyotoCGGT 2007, Revised Selected Papers
ページ155-165
ページ数11
DOI
出版ステータスPublished - 2008 12 1
イベントInternational Conference on Computational Geometry and Graph Theory, KyotoCGGT 2007 - Kyoto, Japan
継続期間: 2007 6 112007 6 15

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
4535 LNCS
ISSN(印刷版)0302-9743
ISSN(電子版)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)

フィンガープリント 「The number of flips required to obtain non-crossing convex cycles」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル