| Budget Amount *help |
¥4,940,000 (Direct Cost: ¥3,800,000、Indirect Cost: ¥1,140,000)
Fiscal Year 2013: ¥1,300,000 (Direct Cost: ¥1,000,000、Indirect Cost: ¥300,000)
Fiscal Year 2012: ¥1,560,000 (Direct Cost: ¥1,200,000、Indirect Cost: ¥360,000)
Fiscal Year 2011: ¥2,080,000 (Direct Cost: ¥1,600,000、Indirect Cost: ¥480,000)
|
|---|
| Research Abstract |
Result of this research includes the theoretical development and efficient algorithms to solve the partition problem for graphs with small tree-width, such as trees, series-parallel graphs and partial k-trees. We modeled power delivery networks by the graph with demand vertices and supply vertices, and find an electric power transmission such that the total of the demands is maximum. In this research, we show that the problem is NP-hard even for trees. For partial k-trees, we give a pseudo polynomial-time algorithm to solve it by introducing a clever partition of graphs and dynamic programming technique. These results are appreciated and one of them won the best paper award of FAW-AAIM 2012.
|
