Study of Huge Graphs for the Design of Nano-Circuits

• 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
• Project Status: Completed (Fiscal Year 2017)
• Budget Amount: ¥4,810,000 (Direct Cost: ¥3,700,000、Indirect Cost: ¥1,110,000); Fiscal Year 2016: ¥1,560,000 (Direct Cost: ¥1,200,000、Indirect Cost: ¥360,000); Fiscal Year 2015: ¥1,690,000 (Direct Cost: ¥1,300,000、Indirect Cost: ¥390,000); Fiscal Year 2014: ¥1,560,000 (Direct Cost: ¥1,200,000、Indirect Cost: ¥360,000)
• 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.

Research Products

• [Journal Article] Stable Matchings in Trees (2017)
  • Author(s): Satoshi Tayu and Shuichi Ueno
  • Journal Title: Lecture Notes in Computer Science Volume: 10392 Pages: 492-503
  • DOI: 10.1007/978-3-319-62389-4_41
  • ISBN: 9783319623887, 9783319623894
  • Peer Reviewed
• [Journal Article] On Evasion Games on Graphs (2016)
  • Author(s): Satoshi Tayu and Shuichi Ueno
  • Journal Title: Lecture Notes in Computer Science Volume: 9943 Pages: 253-264
  • DOI: 10.1007/978-3-319-48532-4_23
  • ISBN: 9783319485317, 9783319485324
  • Peer Reviewed / Acknowledgement Compliant
• [Journal Article] On Orthogonal Ray Trees (2016)
  • Author(s): Irina Mustata, Kousuke Nishikawa, Asahi Takaoka, Satoshi Tayu, Shuichi Ueno
  • Journal Title: Discrete Applied Mathematics Volume: 201 Pages: 201-212
  • DOI: 10.1016/j.dam.2015.07.034
  • Peer Reviewed / Int'l Joint Research / Acknowledgement Compliant
• [Journal Article] Dominating Sets in Two-Directional Orthogonal Ray Graphs (2015)
  • Author(s): Asahi Takaoka, Satoshi Tayu, Shuichi Ueno
  • Journal Title: IEICE Transactions on Information and Systems Volume: E98.D Issue: 8 Pages: 1592-1595
  • DOI: 10.1587/transinf.2015EDL8068
  • NAID: 130005090412
  • ISSN: 0916-8532, 1745-1361
  • Peer Reviewed / Acknowledgement Compliant
• [Journal Article] A Note on Irreversible 2-Conversion Sets in Subcubic Graphs (2015)
  • Author(s): Asahi Takaoka and Shuichi Ueno
  • Journal Title: IEICE Transactions on Information and Systems Volume: E98.D Issue: 8 Pages: 1589-1591
  • DOI: 10.1587/transinf.2015EDL8021
  • NAID: 130005090406
  • ISSN: 0916-8532, 1745-1361
  • Peer Reviewed / Open Access / Acknowledgement Compliant
• [Journal Article] A Note on Harmonious Coloring of Caterpillars (2015)
  • Author(s): Asahi Takaoka, Shingo Okuma, Satoshi Tayu, Shuichi Ueno
  • Journal Title: IEICE Transactions on Information and Systems Volume: E98.D Issue: 12 Pages: 2199-2206
  • DOI: 10.1587/transinf.2015EDP7113
  • NAID: 130005112333
  • ISSN: 0916-8532, 1745-1361
  • Peer Reviewed / Open Access / Acknowledgement Compliant
• [Journal Article] OBDD Representation of Intersection Graphs (2015)
  • Author(s): Asahi Takaoka, Satoshi Tayu, and Shuichi Ueno
  • Journal Title: IEICE Transactions on Information and Systems Volume: E98.D Issue: 4 Pages: 824-834
  • DOI: 10.1587/transinf.2014EDP7281
  • NAID: 130005061853
  • ISSN: 0916-8532, 1745-1361
  • Peer Reviewed
• [Journal Article] 直交半直線交差グラフとナノ回路 (2014)
  • Author(s): 上野修一
  • Journal Title: 電子情報通信学会基礎・境界ソサイエティ機関誌 Volume: 8 Pages: 30-36
  • NAID: 130004959792
• [Journal Article] Dominating Sets and Induced Matchings in Orthogonal Ray Graphs (2014)
  • Author(s): Asahi Takaoka, Satoshi Tayu, and Shuichi Ueno
  • Journal Title: IEICE Transactions on Information and Systems Volume: E97.D Issue: 12 Pages: 3101-3109
  • DOI: 10.1587/transinf.2014EDP7184
  • NAID: 130004841755
  • ISSN: 0916-8532, 1745-1361
  • Peer Reviewed
• [Presentation] A Matching Algorithm for 2-Directional Orthogonal Ray Graphs (2018)
  • Author(s): Ryu Sugimoto, Satoshi Tayu, and Shuichi Ueno
  • Organizer: 電子情報通信学会総合大会
• [Presentation] A Note on the Parallel Complexity of Doubly Lexical Orderings (2018)
  • Author(s): Tsukasa Kobayashi, Satoshi Tayu, and Shuichi Ueno
  • Organizer: 電子情報通信学会総合大会
• [Presentation] On the Recognition of Unit Grid Intersection Graphs (2017)
  • Author(s): Satoshi Tayu and Shuichi Ueno
  • Organizer: 電子情報通信学会回路とシステム研究会
• [Presentation] On the Complexity of Finding a Largest Common Subtree of Trees (2017)
  • Author(s): Hiroki Katsumata, Satoshi Tayu, and Shuichi Ueno
  • Organizer: The 20th Japan Conference on Discrete and Computational Geometry, Graphs, and Games
  • Int'l Joint Research
• [Presentation] A Note on the Largest Common Subgraph Problem (2017)
  • Author(s): Hiroki Katsumata, Satoshi Tayu, and Shuichi Ueno
  • Organizer: 電子情報通信学会総合大会
• [Presentation] A Note on the Subgraph Isomorphism Problem (2017)
  • Author(s): Kotaro Mure, Satoshi Tayu, and Shuichi Ueno
  • Organizer: 電子情報通信学会総合大会
• [Presentation] A Note on the Spanning Subgraph Isomorphism Problem (2016)
  • Author(s): Satoshi Tayu and Shuichi Ueno
  • Organizer: 電子情報通信学会回路とシステム研究会
  • Place of Presentation: 神戸情報大学院大学（兵庫県神戸市）
  • Year and Date: 2016-11-24
• [Presentation] On the Complexity of Finding a Largest Common Subtree of Trees (2016)
  • Author(s): Hiroki Katsumata, Satoshi Tayu, and Shuichi Ueno
  • Organizer: 電子情報通信学会回路とシステム研究会
  • Place of Presentation: 神戸情報大学院大学（兵庫県神戸市）
  • Year and Date: 2016-11-24
• [Presentation] A 3/2-Approximation Algorithm for the Bipartite Dense Subgraph Problem on Bipartite Permutation Graphs (2016)
  • Author(s): Yuta Inaba, Satoshi Tayu, and Shuichi Ueno
  • Organizer: 電子情報通信学会回路とシステム研究会
  • Place of Presentation: 神戸情報大学院大学（兵庫県神戸市）
  • Year and Date: 2016-11-24
• [Presentation] A Note on the Parallel Complexity of Doubly Lexical Orderings (2016)
  • Author(s): Tsukasa Kobayashi, Satoshi Tayu, and Shuichi Ueno
  • Organizer: 電子情報通信学会ソサイエティ大会
  • Place of Presentation: 北海道大学（北海道札幌市）
  • Year and Date: 2016-09-20
• [Presentation] A Parallel Matching Algorithm For Chain Graphs (2016)
  • Author(s): Ryu Sugimoto, Satoshi Tayu, and Shuichi
  • Organizer: 電子情報通信学会ソサイエティ大会
  • Place of Presentation: 北海道大学（北海道札幌市）
  • Year and Date: 2016-09-20
• [Presentation] A Note on the Spanning Subgraph Isomorphism Problem (2016)
  • Author(s): Kenji Ichikawa, Satoshi Tayu, Shuichi Ueno
  • Organizer: 電子情報通信学会総合大会
  • Place of Presentation: 九州大学（福岡県福岡市）
  • Year and Date: 2016-03-15
• [Presentation] On the Three-Dimensional Routing (2016)
  • Author(s): Hiroyuki Gunji, Satoshi Tayu, Shuichi Ueno
  • Organizer: 電子情報通信学会総合大会
  • Place of Presentation: 九州大学（福岡県福岡市）
  • Year and Date: 2016-03-15
• [Presentation] A 3/2-Approximation Algorithm for the Bipartite Dense Subgraph Problem on Bipartite Permutation Graphs (2016)
  • Author(s): Yuta Inaba, Satoshi Tayu, Shuichi Ueno
  • Organizer: 電子情報通信学会総合大会
  • Place of Presentation: 九州大学（福岡県福岡市）
  • Year and Date: 2016-03-15
• [Presentation] On Evasion Games on Graphs (2015)
  • Author(s): Satoshi Tayu, Shuichi Ueno
  • Organizer: 電子情報通信学会回路とシステム研究会
  • Place of Presentation: 指宿市民会館（鹿児島県指宿市）
  • Year and Date: 2015-11-20
• [Presentation] On Evasion Games on Graphs (2015)
  • Author(s): Satoshi Tayu and Shuichi Ueno
  • Organizer: The 18th Japan Conference on Discrete and Computational Geometry and Graphs
  • Place of Presentation: 京都大学（京都府京都市）
  • Year and Date: 2015-09-14
  • Int'l Joint Research
• [Presentation] On Evasion Games on Graphs (2015)
  • Author(s): Satoshi Tayu and Shuichi Ueno
  • Organizer: 電子情報通信学会ソサイエティ大会
  • Place of Presentation: 東北大学（宮城県仙台市）
  • Year and Date: 2015-09-08
• [Presentation] A Note on the Bipartite Dense Subgraph Problem (2015)
  • Author(s): Yuta Inaba, Satoshi Tayu, Shuichi Ueno
  • Organizer: 電子情報通信学会ソサイエティ大会
  • Place of Presentation: 東北大学（宮城県仙台市）
  • Year and Date: 2015-09-08
• [Presentation] On the Complexity of Mining Maximal Frequent Subgraphs (2015)
  • Author(s): Satoshi Tayu, Shuni Go, Shuichi Ueno
  • Organizer: 電子情報通信学会回路とシステム研究会
  • Place of Presentation: 小樽商科大学（北海道小樽市）
  • Year and Date: 2015-06-17
• [Presentation] A Note on the Complexity of Mining Maximal Frequent Subgraphs (2015)
  • Author(s): Shuni Go, Satoshi Tayu, Shuichi Ueno
  • Organizer: 電子情報通信学会総合大会
  • Place of Presentation: 立命館大学（滋賀県草津市）
  • Year and Date: 2015-03-10 – 2015-03-13
• [Presentation] A Note on Irreversible 2-Conversion Sets in Subcubic Graphs (2015)
  • Author(s): Asahi Takaoka, Shuichi Ueno
  • Organizer: 電子情報通信学会総合大会
  • Place of Presentation: 立命館大学（滋賀県草津市）
  • Year and Date: 2015-03-10 – 2015-03-13
• [Presentation] On Evasion Games on Graphs (2015)
  • Author(s): Haruki Itou, Satoshi Tayu, Shuichi Ueno
  • Organizer: 電子情報通信学会総合大会
  • Place of Presentation: 立命館大学（滋賀県草津市）
  • Year and Date: 2015-03-10 – 2015-03-13
• [Presentation] A Note on Irreversible 2-Conversion Sets in Subcubic Graphs (2015)
  • Author(s): Asahi Takaoka, Shuichi Ueno
  • Organizer: 電子情報通信学会コンピュテーション研究会
  • Place of Presentation: 立命館大学（京都府京都市）
  • Year and Date: 2015-03-09
• [Presentation] On the Bipartite Dense Subgraph Problem (2014)
  • Author(s): Satoshi Tayu, Asahi Takaoka, Dai Ito, Shuichi Ueno
  • Organizer: 電子情報通信学会回路とシステム研究会
  • Place of Presentation: 大濱信泉記念館（沖縄県石垣市）
  • Year and Date: 2014-11-20 – 2014-11-21
• [Presentation] Harmonious Coloring of Caterpillars (2014)
  • Author(s): Asahi Takaoka, Shingo Okuma, Satoshi Tayu, Shuichi Ueno
  • Organizer: 電子情報通信学会
  • Place of Presentation: 大濱信泉記念館（沖縄県石垣市）
  • Year and Date: 2014-11-20 – 2014-11-21
• [Presentation] A Note on the Energy-Aware Mapping for NoCs (2014)
  • Author(s): Satoshi Tayu, Shuichi Ueno
  • Organizer: IEEE Asia Pacific Conference on Circuits and Systems
  • Place of Presentation: ANAインターコンチネンタル石垣リゾート（沖縄県石垣市）
  • Year and Date: 2014-11-17 – 2014-11-20
• [Presentation] Weighted Dominating Sets and Induced Matchings in Orthogonal Ray Graphs (2014)
  • Author(s): Asahi Takaoka, Satoshi Tayu, Shuichi Ueno
  • Organizer: International Conference on Control, Decision and Information Technologies
  • Place of Presentation: Universite de Lorraine (Metz, France)
  • Year and Date: 2014-11-03 – 2014-11-05
• [Presentation] Harmonious Coloring of Caterpillars (2014)
  • Author(s): Asahi Takaoka, Shingo Okuma, Satoshi Tayu, Shuichi Ueno
  • Organizer: 電子情報通信学会ソサイエティ大会
  • Place of Presentation: 徳島大学（徳島県徳島市）
  • Year and Date: 2014-09-23 – 2014-09-26
• [Presentation] Weighted Dominating Sets and Induced Matchings in Orthogonal Ray Graphs (2014)
  • Author(s): Asahi Takaoka, Satoshi Tayu, Shuichi Ueno
  • Organizer: 電子情報通信学会回路とシステム研究会
  • Place of Presentation: 北海道大学（北海道札幌市）
  • Year and Date: 2014-07-09 – 2014-07-11
• [Remarks] 東京工業大学工学院上野研究室ホームページ
  • URL: http://www.eda.ce.titech.ac.jp/ueno/paperlists/research-2017.html
• [Remarks] 東京工業大学工学院上野研究室ホームページ
  • URL: http://www.eda.ce.titech.ac.jp/ueno/research.html
• [Remarks] 東京工業大学大学院理工学研究科上野研究室ホームページ
  • URL: http://www.eda.ce.titech.ac.jp/ueno/research.html