| 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)
|
|---|
| 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.
|
