Development of efficient algorithms for solving the discrete optimization problems on intersection graphs.
| Project/Area Number |
22500020
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Single-year Grants |
|---|
| Section | 一般 |
|---|
| Research Field |
Fundamental theory of informatics
|
|---|
| Research Institution | Kushiro National College of Technology |
|---|
Principal Investigator |
HONMA Hirotoshi 釧路工業高等専門学校, 情報工学科, 准教授 (80249721)
|
|---|
| Co-Investigator(Kenkyū-buntansha) |
MASUYAMA Shigeru 豊橋技術科学大学, 大学院・工学研究科, 教授 (60173762)
|
|---|
| Project Period (FY) |
2010 – 2012
|
| Project Status |
Completed (Fiscal Year 2012)
|
| Budget Amount *help |
¥2,340,000 (Direct Cost: ¥1,800,000、Indirect Cost: ¥540,000)
Fiscal Year 2012: ¥650,000 (Direct Cost: ¥500,000、Indirect Cost: ¥150,000)
Fiscal Year 2011: ¥650,000 (Direct Cost: ¥500,000、Indirect Cost: ¥150,000)
Fiscal Year 2010: ¥1,040,000 (Direct Cost: ¥800,000、Indirect Cost: ¥240,000)
|
|---|
| Keywords | アルゴリズム理論 / 離散最適化 / 交差グラフ / アルゴリズム / グラフ理論 / グラフアルゴリズム / 台形グラフ / 置換グラフ / 要節点問題 / 関節節点問題 / 最小フィードバック節点問題 / フィードバック節点集合問題 |
|---|
| Research Abstract |
We developed an efficient algorithm for solving the feedback vertex set problem on trapezoid graphs. Furthermore, we constructed optimal parallel algorithms for solving the articulation vertex and hinge vertex problems on circular permutation graphs.
|
Report
(4 results)
Research Products
(10 results)
