| Project/Area Number |
16500002
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Single-year Grants |
|---|
| Section | 一般 |
|---|
| Research Field |
Fundamental theory of informatics
|
|---|
| Research Institution | Tohoku University |
|---|
Principal Investigator |
ZHOU Xiao Tohoku University, Graduate School of Information Sciences, Associate Professor, 大学院・情報科学研究科, 助教授 (10272022)
|
|---|
| Co-Investigator(Kenkyū-buntansha) |
NISHIZEKI Takao Tohoku University, Graduate School of Information Sciences, Professor, 大学院・情報科学研究科, 教授 (80005545)
浅野 泰仁 東北大学, 大学院・情報科学研究科, 助手 (20361157)
RHAMAN Md.s. 東北大学, 大学院・情報科学研究科, 助教授 (60361151)
三浦 一之 東北大学, 大学院・情報科学研究科, 助手 (80333871)
|
|---|
| Project Period (FY) |
2004 – 2006
|
| Project Status |
Completed (Fiscal Year 2006)
|
| Budget Amount *help |
¥3,700,000 (Direct Cost: ¥3,700,000)
Fiscal Year 2006: ¥1,100,000 (Direct Cost: ¥1,100,000)
Fiscal Year 2005: ¥1,000,000 (Direct Cost: ¥1,000,000)
Fiscal Year 2004: ¥1,600,000 (Direct Cost: ¥1,600,000)
|
|---|
| Keywords | algorithm / partial k-tree / tree-decomposition / coloring |
|---|
| Research Abstract |
In a field of a computational complexity theory and algorithm theory, various combination problems on graphs have been studied. It is known that the most of such problems, including a lot of practical problems, are NP-hard. On the other hand, it is known that some of these problems can be solved in polynomial time for restricted classes of graphs, named partial k-trees. However, in my best knowledge there exist polynomial-time algorithms for solving some particular problems on partial k-trees and no general methods for it. In this research, I investigated existing algorithms for partial k-trees and find some algorithms to solve some combination problems of a part k tree including a [g, f]-coloring algorithm, a multiple coloring algorithm, a cost coloring algorithm, etc. It succeeded to find some conditions for solving some combination optimization and building the methodology that could generate efficient algorithm to solve those problems automatically. Furthermore, for a small k, say one (trees) or two (series-parallel graphs), it succeeded to develop polynomial-time algorithm for solving cost coloring problem, multiple coloring problem, etc. Inspection of effectiveness of the technique was possible theoretically. In this research, I have published 17 journal papers and 20 international conference papers. As a result of having been provided, I give many linear-time algorithms. Its impact in a field of a linear-time algorithm theory is very big.
|
