Sublinear-Time Paradigm

• Project/Area Number: 15K11985
• Research Category: Grant-in-Aid for Challenging Exploratory Research
• Allocation Type: Multi-year Fund
• Research Field: Theory of informatics
• Research Institution: The University of Electro-Communications
• Principal Investigator: Ito Hiro 電気通信大学, 大学院情報理工学研究科, 教授 (50283487)
• Project Period (FY): 2015-04-01 – 2019-03-31
• Project Status: Completed (Fiscal Year 2018)
• Budget Amount: ¥3,640,000 (Direct Cost: ¥2,800,000、Indirect Cost: ¥840,000); Fiscal Year 2017: ¥1,300,000 (Direct Cost: ¥1,000,000、Indirect Cost: ¥300,000); Fiscal Year 2016: ¥1,040,000 (Direct Cost: ¥800,000、Indirect Cost: ¥240,000); Fiscal Year 2015: ¥1,300,000 (Direct Cost: ¥1,000,000、Indirect Cost: ¥300,000)
• Keywords: 定数時間アルゴリズム / 劣線形時間アルゴリズム / ビッグデータ / 複雑ネットワーク / グラフアルゴリズム / 性質検査 / 超有限性 / スケールフリー / 漸進型アルゴリズム / 階層構造 / 一般化将棋 / 計算複雑さ / ボードパズル / 超有限 / 分割信託 / 孤立クリーク / 一般化ボードパズル / ケーキ分割問題 / 分割神託

Outline of Final Research Achievements

The object of this project is establishing fundamental techniques for the “Sublinear-Time Paradigm.” The most remarkable result in this project is presenting a universal algorithm to complex networks, e.g., web graphs and social networks. That is, we define a class of (infinite) multigraphs, named HSF (Hierarchical Scale Free), which models a kind of hierarchical complex networks and prove that every property is constant-time testable for HSF. This is the first nontrivial universal constant-time algorithm on a graph class of sparse and degree-unbounded graphs, what is called the general graphs.

Academic Significance and Societal Importance of the Research Achievements

ビッグデータ時代においては、すべてのデータを読まず一部のデータのみから全体の性質を計算する、劣線形時間アルゴリズム、中でもどんなにデータが巨大になっても高々決まった量のデータしか読まない、定数時間アルゴリズムが重要になる。提案者はこれを「劣線形時間パラダイム」と名付け、そのための基本技術の開発に挑んでいる。今回の成果は、典型的なビッグデータである複雑ネットワークに対する非常に一般性のある定数時間アルゴリズムの提案であり、現実的なビッグデータに対して有効な定数時間アルゴリズムの理論的枠組みを世界で初めて与えた結果であり、理論的工学的インパクトは非常に高い。

Research Products

• [Int'l Joint Research] MIT/University of Nevada, Las Vegas(米国)
• [Int'l Joint Research] Universite libre de Bruxelles(ベルギー)
• [Int'l Joint Research] University of Haifa(イスラエル)
• [Int'l Joint Research] University of Haifa(イスラエル)
• [Int'l Joint Research] MIT(米国)
• [Int'l Joint Research] MIT(米国)
• [Int'l Joint Research] University of Haifa(Israel)
• [Int'l Joint Research] MIT(米国)
• [Int'l Joint Research] University of Haifa(Israel)
• [Journal Article] Energy efficiency and renewable energy management with multi-state power-down system (2019)
  • Author(s): James Andro-Vasko, Wolfgang Bein, and Hiro Ito
  • Journal Title: Information Volume: 10(2) Issue: 2 Pages: 44-44
  • DOI: 10.3390/info10020044
  • Peer Reviewed / Open Access / Int'l Joint Research
• [Journal Article] Modulation-Adaptive Link-Disjoint Path Selection Model for 1+1 Protected Elastic Optical Networks (2019)
  • Author(s): Yuto Kishi, Nattapong Kitsuwan, Hiro Ito, Bijoy Chand Chatterjee, and Eiji Oki,
  • Journal Title: IEEE Access Volume: 7 Pages: 25422-25437
  • DOI: 10.1109/access.2019.2901018
  • Peer Reviewed / Open Access / Int'l Joint Research
• [Journal Article] Cookie Clicker (2019)
  • Author(s): Erik D. Demaine, Hiro Ito, Stefan Langerman, Jayson Lynch, Mikhail Rudoy, Kai Xiao
  • Journal Title: Graphs and Combinatorics Volume: (採録決定)
  • Peer Reviewed / Int'l Joint Research
• [Journal Article] Generalized shogi, chess, and xiangqui are constant-time testable (2019)
  • Author(s): Hiro Ito, Atsuki Nagao, and Teagun Park
  • Journal Title: IEICE Transactions Volume: (採録決定)
  • Peer Reviewed / Int'l Joint Research
• [Journal Article] Bumpy pyramid folding (2018)
  • Author(s): Abel Zachary R.、Demaine Erik D.、Demaine Martin L.、Ito Hiro、Snoeyink Jack、Uehara Ryuhei
  • Journal Title: Computational Geometry Volume: 75 Pages: 22-31
  • DOI: 10.1016/j.comgeo.2018.06.007
  • NAID: 120006676394
  • Peer Reviewed / Int'l Joint Research
• [Journal Article] Unfolding and Dissection of Multiple Cubes, Tetrahedra, and Doubly Covered Squares (2017)
  • Author(s): Zach Abel, Brad Ballinger, Erik Demaine, Martin Demaine, Jeff Erickson, Adam Hesterberg, Hiro Ito, Irina Kostitsyna, Jayson Lynch, and Ryuhei Uehara
  • Journal Title: Journal of Information Processing Volume: 25 Issue: 0 Pages: 610-615
  • DOI: 10.2197/ipsjjip.25.610
  • NAID: 130005990898
  • ISSN: 1882-6652
  • Peer Reviewed / Open Access / Int'l Joint Research
• [Journal Article] A Much Faster Algorithm for Finding a Maximum Clique with Computational Experiments (2017)
  • Author(s): TOMITA Etsuji, MATSUZAKI Sora, NAGAO Atsuki, ITO Hiro, and WAKATSUKI Mitsuo
  • Journal Title: Journal of Information Processing Volume: 25 Issue: 0 Pages: 667-677
  • DOI: 10.2197/ipsjjip.25.667
  • NAID: 130005990921
  • ISSN: 1882-6652
  • Peer Reviewed / Open Access
• [Journal Article] Transforming Graphs with the Same Graphic Sequence (2017)
  • Author(s): Hiro Ito and Sergey Bereg
  • Journal Title: Journal of Information Processing Volume: 25 Issue: 0 Pages: 627-633
  • DOI: 10.2197/ipsjjip.25.627
  • NAID: 130005990901
  • ISSN: 1882-6652
  • Peer Reviewed / Open Access / Int'l Joint Research
• [Journal Article] Every property is testable on a natural class of scale-free multigraphs (2016)
  • Author(s): Hiro Ito
  • Journal Title: Proceedings of the 24th European Symposium of Algorithms (ESA 2016), LIPICS Volume: 57
  • DOI: 10.4230/LIPIcs.ESA.2016.51
  • Peer Reviewed / Open Access / Acknowledgement Compliant
• [Journal Article] Constant-time algorithms for complex networks (2016)
  • Author(s): Hiro Ito
  • Journal Title: Proceedings of the Asian-Pacific World Congress on Computer Science 2016 (APWConCS 2016), IEEE Computer Society Volume: 1
  • Peer Reviewed / Open Access / Acknowledgement Compliant
• [Journal Article] How to solve the cake-cutting problem in sublinear time (2016)
  • Author(s): Hiro Ito and Takahiro Ueda
  • Journal Title: Proceedings of the 8th International Conference on Fun with Algorithms (FUN2016), LIPICS, Vol. 49 (ISBN 978-3-95977-005-7) Volume: 49
  • DOI: 10.4230/LIPIcs.FUN.2016.21
  • Peer Reviewed / Open Access / Acknowledgement Compliant
• [Journal Article] Folding a Paper Strip to Minimize Thickness (2016)
  • Author(s): Erik D. Demaine, David Eppstein, Adam Hesterberg, Hiro Ito, Anna Lubiw, Ryuhei Uehara, and Yushi Uno
  • Journal Title: Journal of Discrete Algorithms Volume: 36 Pages: 18-26
  • DOI: 10.1016/j.jda.2015.09.003
  • NAID: 120006380546
  • Peer Reviewed / Open Access / Int'l Joint Research / Acknowledgement Compliant
• [Journal Article] A Much Faster Algorithm for Finding a Maximum Clique (2016)
  • Author(s): Etsuji Tomita, Kohei Yoshida, Takuro Hatta, Atsuki Nagao, Hiro Ito and Mitsuo Wakatsuki
  • Journal Title: roceedings of the 10th International Frontiers of Algorithmics Workshop (FAW2016) Volume: 未定 Pages: 215-226
  • DOI: 10.1007/978-3-319-39817-4_21
  • ISBN: 9783319398167, 9783319398174
  • Peer Reviewed / Open Access
• [Journal Article] Number of ties and undefeated signs on a generalized janken (2016)
  • Author(s): Hiro Ito and Yoshinao Shiono
  • Journal Title: Proceedings of the 18th Japan Conference on Discrete and Computational Geometry and Graphs (JCDCG^2 2015), LNCS, Springer Volume: 未定
  • Peer Reviewed / Acknowledgement Compliant
• [Journal Article] Single-Player and Two-Player Buttons & Scissors Games (2016)
  • Author(s): Kyle Burke, Erik D. Demaine, Harrison Gregg, Robert A. Hearn, Adam Hesterberg, Michael Hoffman, Hiro Ito, Irina Kostitsyna, Jody Leonard, Maarten Loffler, Christiane Schmidt, Ryuhei Uehara, Yushi Uno and Aaron Williams
  • Journal Title: roceedings of the 18th Japan Conference on Discrete and Computational Geometry and Graphs (JCDCG^2 2015), LNCS, Springer Volume: 未定
  • Peer Reviewed / Int'l Joint Research
• [Journal Article] ow to solve the cake-cutting problem in sublinear time (2016)
  • Author(s): Hiro Ito and Takahiro Ueda
  • Journal Title: Proceedings of the 8th International Conference on Fun with Algorithms (FUN2016) Volume: 未定
  • Peer Reviewed / Acknowledgement Compliant
• [Journal Article] Generalized shogi and chess are constant-time tastable (2015)
  • Author(s): Hiro Ito, Atsuki Nagao, and Teagun Park
  • Journal Title: roceedings of the 12th International Symposium on Operations Research & Its Applications (ISORA 2015), IET Digital Library Volume: なし Pages: 1-6
  • DOI: 10.1049/cp.2015.0601
  • Peer Reviewed / Open Access / Acknowledgement Compliant
• [Journal Article] Computational complexity of inverse word search problem (2015)
  • Author(s): Hiro Ito and Shinnosuke Seki
  • Journal Title: Proceedings of the 12th International Symposium on Operations Research & Its Applications (ISORA 2015), IET Digital Library Volume: なし Pages: 41-44
  • DOI: 10.1049/cp.2015.0607
  • Peer Reviewed / Open Access / Acknowledgement Compliant
• [Presentation] 階層構造に基づく複雑ネットワーク生成モデルの超有限性 (2018)
  • Author(s): 東園和樹, 伊藤大雄
  • Organizer: 電子通信学会コンピューテーション研究会
• [Presentation] Packing polyominoes into a rectangle is constant-time testable (2017)
  • Author(s): Hiro Ito and Yoshihiro Takeda
  • Organizer: The 20th Japan Conference on Discrete and Computational Geometry, Graphs, and Games (JCDCG^3 2017)
  • Int'l Joint Research
• [Presentation] K_3 edge cover in a wide sense (2017)
  • Author(s): Kyohei Chiba, Hiro Ito, and Atsuki Nagao
  • Organizer: The 20th Japan Conference on Discrete and Computational Geometry, Graphs, and Games (JCDCG^3 2017)
  • Int'l Joint Research
• [Presentation] 広義K_3辺被覆問題 (2017)
  • Author(s): 千葉恭平, ベルモント レミー, 伊藤大雄, 長尾篤樹
  • Organizer: 電子通信学会コンピューテーション研究会
• [Presentation] 2種類のアイテムに限定した物理的バケットソート (2016)
  • Author(s): 長尾篤樹, 吉澤修平, 伊藤大雄
  • Organizer: コンピューテーション研究会
  • Place of Presentation: 東北大学（宮城県・仙台市）
• [Presentation] 物理的バケットソート (2016)
  • Author(s): John Iacono, 伊藤大雄, *長尾篤樹, 西野順二, David Rappaport
  • Organizer: コンピューテーション研究会
  • Place of Presentation: 奈良先端科学技術大学院大学（奈良県・生駒市）
• [Presentation] Generalized shogi and chess are constant-time tastable (2015)
  • Author(s): Hiro Ito, Atsuki Nagao, and Teagun Park
  • Organizer: The 12th International Symposium on Operations Research & Its Applications (ISORA 2015)
  • Place of Presentation: Luoyang, China
  • Year and Date: 2015-08-21
  • Int'l Joint Research / Invited