The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Kertas kerja ini mengkaji masalah pembenaman buku daripada graf. Apabila setiap tepi dibenarkan muncul dalam satu atau lebih banyak halaman dengan menyeberangi tulang belakang buku, diketahui umum bahawa setiap graf G boleh dibenamkan dalam buku 3 muka surat. Baru-baru ini, telah ditunjukkan bahawa terdapat pembenaman buku 3 halaman G di mana setiap tepi melintasi tulang belakang O(log2 n) kali. Kertas kerja ini mempertimbangkan buku yang mempunyai lebih daripada tiga muka surat. Dalam kes ini, diketahui bahawa graf lengkap Kn bersama n bucu boleh tertanam dalam a
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Salinan
Miki Shimabara MIYAUCHI, "Trade off between Page Number and Number of Edge-Crossings on the Spine of Book Embeddings of Graphs" in IEICE TRANSACTIONS on Fundamentals,
vol. E83-A, no. 8, pp. 1732-1734, August 2000, doi: .
Abstract: This paper studies the problem of book-embeddings of graphs. When each edge is allowed to appear in one or more pages by crossing the spine of a book, it is well known that every graph G can be embedded in a 3-page book. Recently, it has been shown that there exists a 3-page book embedding of G in which each edge crosses the spine O(log2 n) times. This paper considers a book with more than three pages. In this case, it is known that a complete graph Kn with n vertices can be embedded in a
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e83-a_8_1732/_p
Salinan
@ARTICLE{e83-a_8_1732,
author={Miki Shimabara MIYAUCHI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Trade off between Page Number and Number of Edge-Crossings on the Spine of Book Embeddings of Graphs},
year={2000},
volume={E83-A},
number={8},
pages={1732-1734},
abstract={This paper studies the problem of book-embeddings of graphs. When each edge is allowed to appear in one or more pages by crossing the spine of a book, it is well known that every graph G can be embedded in a 3-page book. Recently, it has been shown that there exists a 3-page book embedding of G in which each edge crosses the spine O(log2 n) times. This paper considers a book with more than three pages. In this case, it is known that a complete graph Kn with n vertices can be embedded in a
keywords={},
doi={},
ISSN={},
month={August},}
Salinan
TY - JOUR
TI - Trade off between Page Number and Number of Edge-Crossings on the Spine of Book Embeddings of Graphs
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1732
EP - 1734
AU - Miki Shimabara MIYAUCHI
PY - 2000
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E83-A
IS - 8
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - August 2000
AB - This paper studies the problem of book-embeddings of graphs. When each edge is allowed to appear in one or more pages by crossing the spine of a book, it is well known that every graph G can be embedded in a 3-page book. Recently, it has been shown that there exists a 3-page book embedding of G in which each edge crosses the spine O(log2 n) times. This paper considers a book with more than three pages. In this case, it is known that a complete graph Kn with n vertices can be embedded in a
ER -