| Budget Amount *help |
¥4,290,000 (Direct Cost: ¥3,300,000、Indirect Cost: ¥990,000)
Fiscal Year 2013: ¥1,040,000 (Direct Cost: ¥800,000、Indirect Cost: ¥240,000)
Fiscal Year 2012: ¥1,040,000 (Direct Cost: ¥800,000、Indirect Cost: ¥240,000)
Fiscal Year 2011: ¥2,210,000 (Direct Cost: ¥1,700,000、Indirect Cost: ¥510,000)
|
|---|
| Research Abstract |
In this study, we considered problems of domination in graphs, and the problem of completely independent spanning trees in graphs. It is known that these problems have been related to the problems of fault-tolerance in networks.
First we considered the problems of domination in graphs, and we obtained some polynomial-time algorithms for problems of twin domination in round digraphs and local-tournaments which are well known classes of digraphs.
Second, we considered the problem of completely independent spanning trees. This problem is a model of fault-tolerant routing in networks. We obtain some new sufficient condition of the existence of completely independent spanning trees in graphs.
|
