2022 Fiscal Year Final Research Report
Research on fast algorithmic meta-theorems for tree decomposable graphs
| Project/Area Number |
20K19742
|
|---|
| Research Category |
Grant-in-Aid for Early-Career Scientists
|
| Allocation Type | Multi-year Fund |
|---|
| Review Section |
Basic Section 60010:Theory of informatics-related
|
|---|
| Research Institution | Hokkaido University (2021-2022)
Kyoto University (2020) |
|---|
Principal Investigator |
|
|---|
| Project Period (FY) |
2020-04-01 – 2023-03-31
|
| Keywords | グラフアルゴリズム / アルゴリズム的メタ定理 / 木幅 / 列挙アルゴリズム / 組合せ遷移 |
|---|
| Outline of Final Research Achievements |
The purpose of this work is to study fast algorithmic meta-theorems for tree decomposable graphs. As parts of this work, we give (1) a generic designing scheme for enumeration algorithms, (2) several algorithmic techniques based on vertex integrity, and (3) algorithmic meta-theorems for reconfiguration problems. Although the result of (2) is not considered as a "meta-theorem", it would stimulate a successive study on fast algorithmic meta-theorems for vertex integrity, given by other researchers.
|
| Free Research Field |
アルゴリズムと計算量
|
| Academic Significance and Societal Importance of the Research Achievements |
現段階では理論的な研究に留まっているが，これらの成果に基づいて実用的な研究が進めることで社会へ貢献ができるため，その社会的な意義があると考えられる．また，本研究の理論研究の一部が発端となり，さらなる研究が国内外の研究者から行われ始めていることを鑑みると，その学術的な意義は十分にあると考えられる．
|
