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
|
Project Status |
Completed (Fiscal Year 2014)
|
Budget Amount *help |
¥5,200,000 (Direct Cost: ¥4,000,000、Indirect Cost: ¥1,200,000)
Fiscal Year 2013: ¥1,560,000 (Direct Cost: ¥1,200,000、Indirect Cost: ¥360,000)
Fiscal Year 2012: ¥1,820,000 (Direct Cost: ¥1,400,000、Indirect Cost: ¥420,000)
Fiscal Year 2011: ¥1,820,000 (Direct Cost: ¥1,400,000、Indirect Cost: ¥420,000)
|
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.
|
Report
(5 results)
Research Products
(39 results)
-
-
-
-
-
-
[Presentation] On Orthogonal Ray Trees2014
Author(s)
Asahi Takaoka, Satoshi Tayu, Shuichi Ueno
Organizer
Japan Conference on Graph Theory and Combinatorics
Place of Presentation
日本大学(東京都世田谷区)
Year and Date
2014-05-17 – 2014-05-21
Related Report
-
-
-
-
-
-
-
-
-
-
-
[Presentation] Stable Matchings in Trees
Author(s)
Satoshi Tayu, Shuichi Ueno
Organizer
The 16th Japan Conference on Discrete and Computational Geometry and Graphs
Place of Presentation
東京理科大学(東京都)
Related Report
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-