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
|
| Project Status |
Completed (Fiscal Year 2016)
|
| Budget Amount *help |
¥4,680,000 (Direct Cost: ¥3,600,000、Indirect Cost: ¥1,080,000)
Fiscal Year 2015: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000)
Fiscal Year 2014: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000)
Fiscal Year 2013: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000)
Fiscal Year 2012: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000)
|
|---|
| 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.
|
Report
(6 results)
Research Products
(41 results)
-
-
-
-
-
-
-
-
-
-
-
-
-
-
[Journal Article] Minimum-Cost b-Edge Dominating Sets on Trees2014
Author(s)
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, and Yoshio Okamoto
-
Journal Title
Lecture Notes in Computer Science
Volume: 8889
Pages: 195-207
DOI
ISBN
9783319130743, 9783319130750
Related Report
Peer Reviewed / Acknowledgement Compliant
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
