2016 Fiscal Year Final Research Report
Using dual concepts in graph minor algorithms
| Project/Area Number |
24700004
|
|---|
| Research Category |
Grant-in-Aid for Young Scientists (B)
|
| Allocation Type | Multi-year Fund |
|---|
| Research Field |
Fundamental theory of informatics
|
|---|
| Research Institution | University of Tsukuba (2015-2016)
The University of Tokyo (2012-2014) |
|---|
Principal Investigator |
|
|---|
| Project Period (FY) |
2012-04-01 – 2017-03-31
|
| Keywords | アルゴリズム / グラフ / 組合せ最適化 / 辺素パス問題 / グラフマイナー理論 |
|---|
| Outline of Final Research Achievements |
The edge-disjoint paths problem is a problem of connecting given pairs of vertices by edge-disjoint paths, which is motivated by applications in VLSI design and transportation networks. This problem is also theoretically interesting, because it was solved by using graph minor theory, which is a profound theory in discrete mathematics. In this study, we show efficient algorithms for the edge-disjoint paths problem and its related problems by using a certain kind of duality in the problems.
|
| Free Research Field |
組合せ最適化
|
