Study of Huge Graphs for the Design of Nano-Circuits

2017 Fiscal Year Final Research Report

• Project/Area Number: 26330007
• Research Category: Grant-in-Aid for Scientific Research (C)
• Allocation Type: Multi-year Fund
• Section: 一般
• Research Field: Theory of informatics
• Research Institution: Tokyo Institute of Technology
• Principal Investigator: UENO SHUICHI 東京工業大学, 工学院, 教授 (30151814)
• Project Period (FY): 2014-04-01 – 2018-03-31
• Keywords: アルゴリズム / グラフ / ナノ回路

Outline of Final Research Achievements

We further 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). Since the size of orthogonal ray graphs for the defect-tolerant design of nano-circuits is huge, we need efficient data structures and algorithms for the graphs. We showed that the OBDD (ordered Binary Decision Diagram) is an efficient data structure for the orthogonal ray graph. We proposed an efficient parallel algorithm to solve the dual lexical ordering problem for convex graphs. The problem plays an important role in the defect-tolerant design of nano-circuits.

Free Research Field

情報学