2014 Fiscal Year Final Research Report
Study of Practical Efficient Algorithms for Design of Nano-Circuits
| Project/Area Number |
23500009
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Multi-year Fund |
|---|
| Section | 一般 |
|---|
| Research Field |
Fundamental theory of informatics
|
|---|
| Research Institution | Tokyo Institute of Technology |
|---|
Principal Investigator |
UENO SHUICHI 東京工業大学, 理工学研究科, 教授 (30151814)
|
|---|
| Project Period (FY) |
2011-04-28 – 2015-03-31
|
| Keywords | アルゴリズム / グラフ / ナノ回路 |
|---|
| Outline of Final Research Achievements |
We developed the theory of orthogonal ray graphs. An orthogonal ray graph is an intersection graph of a set of horizontal or vertical rays (half-lines). Based on the theory of orthogonal ray graphs, we proposed an efficient algorithm to solve the subgraph isomorphism problem for orthogonal ray trees. We also proposed an efficient algorithm to solve the balanced complete bipartite subgraph problem for bipartite permutation graphs, which are a subclass of orthogonal ray graphs. The problems play important role in the defect-tolerant design of nano-circuits.
|
| Free Research Field |
総合領域
|
