2015 Fiscal Year Final Research Report
Inapproximability of graph width parameters
| Project/Area Number |
24500007
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Multi-year Fund |
|---|
| Section | 一般 |
|---|
| Research Field |
Fundamental theory of informatics
|
|---|
| Research Institution | Gunma University |
|---|
Principal Investigator |
|
|---|
| Project Period (FY) |
2012-04-01 – 2016-03-31
|
| Keywords | グラフパラメータ / 近似困難性 / Small Set Expansion 予想 / rank-width / clique-width / boolean-width |
|---|
| Outline of Final Research Achievements |
The research shows that there are no polynomial time approximation algorithms with constant performance ratios for several graph width parameters such as rank-width, clique-width, carving-width, and boolean-width under Small Set Expansion conjecture. The inapproximability of path-distance-width, which was one of targets of the research, could not be clarified, but the inapproximability of maximum induced matching-width was serendipitously shown.
We also obtained the following two results as a by-product: One is some result on an infinite hierarchy of thin strip graphs, the other is a result on algebraic property of tangle (a dual notion of branch-width).
|
| Free Research Field |
グラフアルゴリズム
|
