| Project/Area Number |
14580373
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Single-year Grants |
|---|
| Section | 一般 |
|---|
| Research Field |
計算機科学
|
|---|
| Research Institution | KYOTO UNIVERSITY |
|---|
Principal Investigator |
ITO Hiroo Kyoto University, Graduate School of Informatics, Associate Professor, 情報学研究科, 助教授 (50283487)
|
|---|
| Co-Investigator(Kenkyū-buntansha) |
IWAMA Kazuo Kyoto University, Graduate School of Informatics, Professor, 情報学研究科, 教授 (50131272)
|
|---|
| Project Period (FY) |
2002 – 2003
|
| Project Status |
Completed (Fiscal Year 2003)
|
| Budget Amount *help |
¥2,000,000 (Direct Cost: ¥2,000,000)
Fiscal Year 2003: ¥800,000 (Direct Cost: ¥800,000)
Fiscal Year 2002: ¥1,200,000 (Direct Cost: ¥1,200,000)
|
|---|
| Keywords | graphs / networks / the Internet / shortest path / routing / hypergraphs / convex polygons / location problems / 3カット / 連結度 / ルーチング / ファイル転送 / 最短路 |
|---|
| Research Abstract |
1.Source Location Problems
For a source location problem on digraphs and with constraints of edge-connectivity of both directions, we gave a polynomial-time algorithm.
2.Fault-tolerant Routing Method of the Internet
For avoiding the "routing loop problem," which occurs when a network condition have been changed, we proposed a routing method to broadcast the information of the change gradually. We proved that this method avoids routing loops at all, and moreover we find the minimum number of steps of the broadcasting.
3.File Transfer Tree Problem
For a given digraph, a specified vertex (root), and an upper bound of out-degree for each vertex, we consider a problem of finding a shortest path tree rooted on the root satisfying the out-degree constraint. We presented a polynomial time algorithm for this problem.
4.Properties of Hypergraphs Drawn on a Convex Polygon
We consider hypergraph drawing on a convex polygon and found equivalence between a condition on the sum of areas of hyperedges and a condition on convex three-cuts of the hypergraph.
|
