| Project/Area Number |
22500009
|
|---|
| 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 |
|
|---|
| Co-Investigator(Kenkyū-buntansha) |
若月 光夫 電気通信大学, 情報理工学(系)研究科, 助教 (30251705)
高橋 治久 電気通信大学, 情報理工学(系)研究科, 教授 (90135418)
西野 哲朗 電気通信大学, 情報理工学(系)研究科, 教授 (10198484)
|
|---|
| Project Period (FY) |
2010 – 2012
|
| Project Status |
Completed (Fiscal Year 2012)
|
| Budget Amount *help |
¥4,160,000 (Direct Cost: ¥3,200,000、Indirect Cost: ¥960,000)
Fiscal Year 2012: ¥1,430,000 (Direct Cost: ¥1,100,000、Indirect Cost: ¥330,000)
Fiscal Year 2011: ¥1,300,000 (Direct Cost: ¥1,000,000、Indirect Cost: ¥300,000)
Fiscal Year 2010: ¥1,430,000 (Direct Cost: ¥1,100,000、Indirect Cost: ¥330,000)
|
|---|
| Keywords | 最大クリーク / 極大クリーク / NP完全問題 / 時間計算量 / 多項式時間的可解性 / 分枝限定法 / バイオインフォマティクス / 計算機実験 / データマイニング |
|---|
| Research Abstract |
We developed some sufficient conditions and algorithms for arbitrary graphs by which the maximum clique problem can be solved in polynomial time. These algorithms can find an exact maximum clique in any arbitrary graph without any condition. We also confirmed experimentally that our newly developed another maximum-clique-finding algorithm works very efficiently. These algorithms were effectively applied for some problems as in bioinformatics.
|
