| Presentation | 2004-06-25 Embedding bipartite graphs into book space Miki MIYAUCHI, |
|---|---|
| PDF Download Page |  PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | This paper studies the problem of book-embeddings of bipartite 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, we have shown that there exists a d+1-page book embedding of G in which each edge crosses the spine O(log_dn) times. This result is the best possible for K_n in this case. This paper shows that there exists a d+1-page book embedding of a bipartite graph G_ |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | Bipartite graph / Book embedding / Crossings of edges over the spine |
| Paper # | COMP2004-24 |
| Date of Issue |
| Conference Information | |
| Committee | COMP |
|---|---|
| Conference Date | 2004/6/18(1days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | |
| Chair | |
| Vice Chair | |
| Secretary | |
| Assistant | |
| Paper Information | |
| Registration To | Theoretical Foundations of Computing (COMP) |
|---|---|
| Language | JPN |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | Embedding bipartite graphs into book space |
| Sub Title (in English) | |
| Keyword(1) | Bipartite graph |
| Keyword(2) | Book embedding |
| Keyword(3) | Crossings of edges over the spine |
| 1st Author's Name | Miki MIYAUCHI |
| 1st Author's Affiliation | NTT Communication Science Laboratories() |
| Date | 2004-06-25 |
| Paper # | COMP2004-24 |
| Volume (vol) | vol.104 |
| Number (no) | 147 |
| Page | pp.pp.- |
| #Pages | 5 |
| Date of Issue | |