2011 Fiscal Year Final Research Report
Studies on the design of algorithms for reliable networks and its application
| Project/Area Number |
20700002
|
|---|
| Research Category |
Grant-in-Aid for Young Scientists (B)
|
| Allocation Type | Single-year Grants |
|---|
| Research Field |
Fundamental theory of informatics
|
|---|
| Research Institution | Otaru University of Commerce |
|---|
Principal Investigator |
|
|---|
| Project Period (FY) |
2008 – 2011
|
| Keywords | アルゴリズム理論 / 離散最適化 / 組合せ最適化 / グラフ理論 / グラフ連結度 |
|---|
| Research Abstract |
In modern society, we have many networks such as traffic networks and communication networks. It is required that such networks have some fault-tolerance. The concepts of graph connectivity are known as one measure of network fault-tolerance. In this research, we proposed several efficient algorithms for connectivity augmentation problems and source location problems, which are well-known as graph problems concerning connectivity. Also, we generalized these results, which may contribute to the analysis of other problems.
|
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
[Book] 朝倉書店2010
Author(s)
茨木俊秀,永持仁,石井利昌
Total Pages
76-157, 225-237
Publisher
グラフ理論-連結構造とその応用
-
-
-
-
