2017 Fiscal Year Final Research Report
Characterization for tractability of finding paths in graphs based on forbidden structures
| Project/Area Number |
16H06931
|
|---|
| Research Category |
Grant-in-Aid for Research Activity Start-up
|
| Allocation Type | Single-year Grants |
|---|
| Research Field |
Foundations of mathematics/Applied mathematics
|
|---|
| Research Institution | Osaka University |
|---|
Principal Investigator |
|
|---|
| Project Period (FY) |
2016-08-26 – 2018-03-31
|
| Keywords | アルゴリズム / グラフ / 離散数学 / 組合せ最適化 |
|---|
| Outline of Final Research Achievements |
To explore and clarify the theoretical limitation of efficient algorithms for a variety of combinatorial optimization problems, I have investigated problems on paths and matchings in graphs.
|
| Free Research Field |
情報数理学
|
