| Project/Area Number |
10205201
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research on Priority Areas (B)
|
| Allocation Type | Single-year Grants |
|---|
| Research Institution | Tohoku University |
|---|
Principal Investigator |
ZHOU Xiao Tohoku University, Graduate School of Information Sciences, Associate Professor, 情報科学研究科, 助教授 (10272022)
|
|---|
| Co-Investigator(Kenkyū-buntansha) |
MIZUKI Takaaki Tohoku University, Information Synergy Center, Associate Professor, ネットワーク研究部, 助教授 (90323089)
KUSAKARI Yishiyoki Akita Prefectural University, Department of Electronics and Information Systems, Lecturer, システム科学技術学部・電子情報システム学科, 講師 (50302203)
|
|---|
| Project Period (FY) |
1998 – 2000
|
| Project Status |
Completed (Fiscal Year 2001)
|
| Budget Amount *help |
¥10,700,000 (Direct Cost: ¥10,700,000)
Fiscal Year 2000: ¥2,600,000 (Direct Cost: ¥2,600,000)
Fiscal Year 1999: ¥3,600,000 (Direct Cost: ¥3,600,000)
Fiscal Year 1998: ¥4,500,000 (Direct Cost: ¥4,500,000)
|
|---|
| Keywords | graph / algorithm / edge-coloring / total coloring / cost edge-coloring / 1-vertex-coloring / [g, f]-coloring / 点彩色 / 金彩色 / 部分k-ホ / 辺ランク / ランク付け / 辺ランク付け / 彩色問題 |
|---|
| Research Abstract |
The scheduling problem was modeled by using the graph in this research. It is well-known that the coloring problem, from which the application to this problem is strongly expected, is NP-hard in general. So it is very unlikely that there exists an efficient algorithm to solve it. However, we showed that the problem can be solved efficiently for some restricted class of graphs. The results achieved for this research are chiefly four of the following.
1. We gave a linear algorithm to solve [g, f]-coloring problem for partial k-trees by a dynamic programming method. This result was published in Algorithmica(1999).
2. We give a linear algorithm to solve the total coloring problem for partial k-trees which is published in ISAAC' 99. Afterwards, we improved it for degenerate graphs which is published in ICALP' 01.
3. We gave a polynomial-time algorithm to solve the 1-vertex-coloring problem for partial k-trees which is published in IEICE Trans. on fundamentals of Electronics, Communication and Computer Science (2000).
4. We give a polynomial-time algorithm to solve the cost edge-coloring problem for trees which is published in COCOON' 01.
|
