| Presentation | 2005-10-18 Queue layout of bipartite graph subdivisions Miki MIYAUCHI, |
|---|---|
| PDF Download Page |  PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | This paper studies the problem of queue layout of bipartite graph subdivisions. A k-queue layout of a graph consists of a total order of the vertices, and a partition of the edges into k sets of non-nested edges with respect to the vertex ordering. Recently Dujmovic and Wood showed that every graph G has a d-queue subdivision with 2⌈log_d n⌉+1 division vertices per edge. This paper deals with a bipartite graph G_ |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | bipartite graph / subdivision / queue / queue layout of graphs |
| Paper # | COMP2005-36 |
| Date of Issue |
| Conference Information | |
| Committee | COMP |
|---|---|
| Conference Date | 2005/10/11(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) | Queue layout of bipartite graph subdivisions |
| Sub Title (in English) | |
| Keyword(1) | bipartite graph |
| Keyword(2) | subdivision |
| Keyword(3) | queue |
| Keyword(4) | queue layout of graphs |
| 1st Author's Name | Miki MIYAUCHI |
| 1st Author's Affiliation | NTT Communication Science Laboratories, NTT Corporation() |
| Date | 2005-10-18 |
| Paper # | COMP2005-36 |
| Volume (vol) | vol.105 |
| Number (no) | 343 |
| Page | pp.pp.- |
| #Pages | 5 |
| Date of Issue | |