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
이 논문은 다음의 문제를 연구한다. 책 삽입 그래프의. 각 가장자리가 하나로 표시되도록 허용되는 경우 또는 그 이상의 페이지 책등을 가로지르면 모든 그래프가 G 3페이지짜리 책에 삽입할 수 있습니다. 최근에는 3페이지 분량의 책이 삽입되어 있는 것으로 나타났습니다. G 각 가장자리가 척추를 교차하는 형태 O(로그2 n) 번. 이 논문에서는 3페이지가 넘는 책을 고려합니다. 이 경우 완전한 그래프가 나타나는 것으로 알려져 있습니다. Kn 과 n 정점은
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.
부
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
부
@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},}
부
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 -