| Presentation | 2011-12-16 Algorithms for Bandwidth Consecutive Multicolorings of Graphs Kazuhide NISIKAWA, Takao NISHIZEKI, Xiao ZHOU, |
|---|---|
| PDF Download Page |  PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | Let G be a simple graph in which each vertex v has a positive integer weight b(v) and each edge (v, w) has a nonnegative integer weight b(v, w). A bandwidth consecutive multicoloring of G assigns each vertex v a specified number b(v) of consecutive positive integers so that, for each edge (v, w), all integers assigned to vertex v differ from all integers assigned to vertex w by more than b(v, w). The maximum integer assigned to a vertex is called the span of the coloring. In the paper, we first investigate fundamental properties of such a coloring. We then obtain a pseudo polynomial-time exact algorithm and a fully polynomial-time approximation scheme for the problem of finding such a coloring of a given graph with the minimum span for the case G is a series-parallel graph. We finally extend the results to the case G is a partial k-tree, that is, G has a bounded tree-width. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | Bandwidth coloring / Channel assignment / Multicoloring / Series-parallel graph / Partial k-tree / Algorithm / Acyclic orientation / Approximation / FPTAS |
| Paper # | COMP2011-38 |
| Date of Issue |
| Conference Information | |
| Committee | COMP |
|---|---|
| Conference Date | 2011/12/9(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 | ENG |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | Algorithms for Bandwidth Consecutive Multicolorings of Graphs |
| Sub Title (in English) | |
| Keyword(1) | Bandwidth coloring |
| Keyword(2) | Channel assignment |
| Keyword(3) | Multicoloring |
| Keyword(4) | Series-parallel graph |
| Keyword(5) | Partial k-tree |
| Keyword(6) | Algorithm |
| Keyword(7) | Acyclic orientation |
| Keyword(8) | Approximation |
| Keyword(9) | FPTAS |
| 1st Author's Name | Kazuhide NISIKAWA |
| 1st Author's Affiliation | School of Science and Engineering, Kwansei Gakuin University() |
| 2nd Author's Name | Takao NISHIZEKI |
| 2nd Author's Affiliation | School of Science and Engineering, Kwansei Gakuin University |
| 3rd Author's Name | Xiao ZHOU |
| 3rd Author's Affiliation | Graduate School of Information Sciences, Tohoku University |
| Date | 2011-12-16 |
| Paper # | COMP2011-38 |
| Volume (vol) | vol.111 |
| Number (no) | 360 |
| Page | pp.pp.- |
| #Pages | 8 |
| Date of Issue | |