| Budget Amount *help |
¥1,820,000 (Direct Cost: ¥1,400,000、Indirect Cost: ¥420,000)
Fiscal Year 2017: ¥520,000 (Direct Cost: ¥400,000、Indirect Cost: ¥120,000)
Fiscal Year 2016: ¥650,000 (Direct Cost: ¥500,000、Indirect Cost: ¥150,000)
Fiscal Year 2015: ¥650,000 (Direct Cost: ¥500,000、Indirect Cost: ¥150,000)
|
|---|
| Outline of Final Research Achievements |
In the field of graph theory, algorithm theory, and computational complexity theory, branch-width, which is a graph parameter, has been intensively investigated. The purpose of this study is to clarify the structure of tangle from an algebraic point of view, where tangle is a dual concept of branch-width. The following six results were obtained in this study: (1) Similarity between maximal ideal and tangle, (2) Similarity between ideal and loose tangle, (3) Role of submodularity in tangle, (4) Game theoretical interpretation of tangle, (5) A relation linear-width and singly ideal, (6) Topological interpretation of tangle.
|
