A study of graph width parameters
Project/Area Number |
21500004
|
Research Category |
Grant-in-Aid for Scientific Research (C)
|
Allocation Type | Single-year Grants |
Section | 一般 |
Research Field |
Fundamental theory of informatics
|
Research Institution | Gunma University |
Principal Investigator |
YAMAZAKI Koichi 群馬大学, 大学院・工学研究科, 教授 (00246662)
|
Project Period (FY) |
2009 – 2011
|
Project Status |
Completed (Fiscal Year 2011)
|
Budget Amount *help |
¥1,950,000 (Direct Cost: ¥1,500,000、Indirect Cost: ¥450,000)
Fiscal Year 2011: ¥650,000 (Direct Cost: ¥500,000、Indirect Cost: ¥150,000)
Fiscal Year 2010: ¥650,000 (Direct Cost: ¥500,000、Indirect Cost: ¥150,000)
Fiscal Year 2009: ¥650,000 (Direct Cost: ¥500,000、Indirect Cost: ¥150,000)
|
Keywords | 木幅 / パス幅 / パス距離幅 / 近似アルゴリズム / グラフパラメータ / tree-width |
Research Abstract |
The purpose of this study is to design approximation algorithms for tree-width, branch-width, bandwidth, path-width, and so on by considering its duality. As the result of the study, we showed that the distance path width of AT-free graphs can be approximated within a constant factor in polynomial time. Moreover, by considering the duality, we gave lower bounds for tree-width for Cartesian products of graphs, and extended the notion of forbidden structure for path-width to matroids.
|
Report
(4 results)
Research Products
(34 results)
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
[Presentation] カット幅の双対定理について2011
Author(s)
片平明, 桑原勇人, 長澤亮介, 大舘陽太, 山崎浩一
Organizer
2010年度冬のLAシンポジウム
Place of Presentation
京都大学
Year and Date
2011-02-02
Related Report
-
-
-
-
-
-
-
-
-
-