Design of algorithms for problems of fault-tolerance of networks
| Project/Area Number |
23500007
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Multi-year Fund |
|---|
| Section | 一般 |
|---|
| Research Field |
Fundamental theory of informatics
|
|---|
| Research Institution | Gunma University |
|---|
Principal Investigator |
ARAKI Toru 群馬大学, 理工学研究院, 准教授 (40361042)
|
|---|
| Project Period (FY) |
2011 – 2013
|
| Project Status |
Completed (Fiscal Year 2013)
|
| 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)
|
|---|
| Keywords | アルゴリズム / 情報基礎 / グラフ理論 / ネットワーク / 耐故障性 / グラフアルゴリズム / 支配集合問題 / 全域木 / 完全独立全域木 / 有向グラフ / 局所トーナメント / コーダルグラフ |
|---|
| 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.
|
Report
(4 results)
Research Products
(9 results)
