Algorithms for width-parameters of digraphs and their applications
| Project/Area Number |
23500026
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Multi-year Fund |
|---|
| Section | 一般 |
|---|
| Research Field |
Fundamental theory of informatics
|
|---|
| Research Institution | Meiji University |
|---|
Principal Investigator |
TAMAKI Hisao 明治大学, 理工学部, 教授 (20111354)
|
|---|
| Project Period (FY) |
2011 – 2013
|
| Project Status |
Completed (Fiscal Year 2013)
|
| Budget Amount *help |
¥4,550,000 (Direct Cost: ¥3,500,000、Indirect Cost: ¥1,050,000)
Fiscal Year 2013: ¥1,430,000 (Direct Cost: ¥1,100,000、Indirect Cost: ¥330,000)
Fiscal Year 2012: ¥1,430,000 (Direct Cost: ¥1,100,000、Indirect Cost: ¥330,000)
Fiscal Year 2011: ¥1,690,000 (Direct Cost: ¥1,300,000、Indirect Cost: ¥390,000)
|
|---|
| Keywords | 有向グラフ / パス幅 / 固定パラメータアルゴリズム / 厳密指数時間アルゴリズム / グラフ / 木幅 / 分枝幅 / 表面埋め込み / 種数 / グラフアルゴリズム / 木分割 / パス分割 / グラフ分割 |
|---|
| Research Abstract |
For the problem of computing the pathwidth of digraphs, an XP algorithm (with running time n to the O(k), where n is the number of vertices and k is the pathwidth, and an algorithm with running time O(1.89 to the nth), were developed. The first version of the XP algorithm contained an essential flaw, and a considerable amount of time was spent for fixing the error. As applications, FPT algorithms for two-layer graph drawing problems were developed.
|
Report
(4 results)
Research Products
(18 results)
