2011 Fiscal Year Final Research Report
Research on parameterized graph algorithms
| Project/Area Number |
21500007
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Single-year Grants |
|---|
| Section | 一般 |
|---|
| Research Field |
Fundamental theory of informatics
|
|---|
| Research Institution | The University of Electro-Communications |
|---|
Principal Investigator |
TAKENAGA Yasuhiko 電気通信大学, 大学院・情報理工学研究科, 准教授 (20236491)
|
|---|
| Project Period (FY) |
2009 – 2011
|
| Keywords | アルゴリズム / グラフ / 計算量 |
|---|
| Research Abstract |
We have developed fixed-parameter algorithms or proved the hardness of vertex coloring problems on parameterized graphs obtained by adding or deleting edges from graphs in classes such as comparability graphs, permutation graphs and grid graphs. We have also developed a fixed-parameter algorithm for isomorphism of tree+ ke graphs. In addition, we have clarified the property of problems and parameterized graph classes which makes it possible to design fixed-parameter algorithms.
|
