| Budget Amount *help |
¥4,420,000 (Direct Cost: ¥3,400,000、Indirect Cost: ¥1,020,000)
Fiscal Year 2018: ¥1,300,000 (Direct Cost: ¥1,000,000、Indirect Cost: ¥300,000)
Fiscal Year 2017: ¥1,560,000 (Direct Cost: ¥1,200,000、Indirect Cost: ¥360,000)
Fiscal Year 2016: ¥1,560,000 (Direct Cost: ¥1,200,000、Indirect Cost: ¥360,000)
|
|---|
| Outline of Final Research Achievements |
The results obtained in this research are theoretical development of efficient algorithms for graphs with small tree-widths. The tree-width of a graph is the maximum value obtained by subtracting 1 from the number of vertices in nodes of its tree-decomposition. The graph of tree-width 1 is a forest, and the graph of tree-width 2 is series-parallel. In this research, in particular, we succeeded in researching and developing efficient algorithms for solving many combinatoric optimal problems by introducing graph division and clever dynamic programming to a graph having a tree structure. In particular, the algorithms developed in this research are applicable to many combinatoric problems, and we have published 12 academic papers summarizing the results obtained in this research, which can be highly appreciated.
|
