Efficient Data structures for Plane Graphs

• Project/Area Number: 20500005
• Research Category: Grant-in-Aid for Scientific Research (C)
• Allocation Type: Single-year Grants
• Section: 一般
• Research Field: Fundamental theory of informatics
• Research Institution: Gunma University
• Principal Investigator: NAKANO Shinichi Gunma University, 大学院・工学研究科, 教授 (30227855)
• Project Period (FY): 2008 – 2010
• Project Status: Completed (Fiscal Year 2010)
• Budget Amount: ¥4,550,000 (Direct Cost: ¥3,500,000、Indirect Cost: ¥1,050,000); Fiscal Year 2010: ¥1,300,000 (Direct Cost: ¥1,000,000、Indirect Cost: ¥300,000); Fiscal Year 2009: ¥1,430,000 (Direct Cost: ¥1,100,000、Indirect Cost: ¥330,000); Fiscal Year 2008: ¥1,820,000 (Direct Cost: ¥1,400,000、Indirect Cost: ¥420,000)
• Keywords: アルゴリズム / 平面グラフ / 情報基礎 / データ構造 / 列挙 / グラフ

Research Abstract

We have designed several compact data structures to represent some plane structures. Our data structures are compact, simple and support basic queries. Also we can compute the original data from the compact data structure if it is needed.
For instance we have designed a compact binary string to represent unordered trees in which each vertex has at most two children. The length of the binary string is near the theoretical compression bound.

Research Products

• [Journal Article] Efficient Enumeration of All Ladder Lotteries and Its Application (2010)
  • Author(s): Katsuhisa Yamanaka, Shin-ichi Nakano, Yasuko Matsui, Ryuhei Uehara, Kento Nakada
  • Journal Title: Theoretical Computer Science Vol.411 Pages: 1714-1722
  • NAID: 120002511577
  • Peer Reviewed
• [Journal Article] A Compact Encoding of Plane Triangulations with Efficient Query Support (2010)
  • Author(s): 山中克久, 中野眞一
  • Journal Title: Information Processing Letters Vol.110 Pages: 803-809
  • NAID: 110002812579
  • Peer Reviewed
• [Journal Article] 2連結平面グラフのst-numberingの列挙 (2010)
  • Author(s): 金子昌弘,中野眞一
  • Journal Title: 日本応用数理学会論文誌 Vol.20,no.1 Pages: 33-44
  • Peer Reviewed
• [Journal Article] Efficient Enumeration of All LadderLotteries and Its Application (2010)
  • Author(s): K.Yamanaka, 他4名
  • Journal Title: Theoretical Computer Science Volume: 41 Pages: 1714-1722
  • Peer Reviewed
• [Journal Article] A Compact Encoding of Plane Triangulations with Efficient Query Sunpport (2010)
  • Author(s): K.Yamanaka, S.Nakano
  • Journal Title: Information Processing Letters Volume: 110 Pages: 803-809
  • Peer Reviewed
• [Journal Article] 2連結平面グラフのst-numberingの列挙 (2010)
  • Author(s): 金子昌弘, 中野眞一
  • Journal Title: 日本応用数理学会論文誌 (掲載決定)
  • Peer Reviewed
• [Journal Article] Listing All Plane Graphs (2009)
  • Author(s): 山中克久, 中野眞一
  • Journal Title: JGAA Journal of Graph Algorithms and Applications Vol.13,No.1 Pages: 5-18
  • NAID: 110006404226
  • Peer Reviewed
• [Journal Article] A New Approach to Graph Recognition and Applications to Distance Hereditary Graphs (2009)
  • Author(s): Shin-ichi Nakano, Ryuhei Uehara, Takeaki Uno
  • Journal Title: Journal of Computer Science and Technology Vol.24(3) Pages: 517-533
  • NAID: 120002511580
  • Peer Reviewed
• [Journal Article] A Simple Canonical Code for Fullerene Graphs (2009)
  • Author(s): Naoki Shimotsuma, Shin-ichi Nakano
  • Journal Title: 電子情報通信学会英文論文誌A,IEICE TRANS.FUNDAMENTALS Vol.E92-A,no.12 Pages: 3398-2400
  • NAID: 10026862123
  • Peer Reviewed
• [Journal Article] Listing All Plane Graphs (2009)
  • Author(s): K.Yamanaka, S.Nakano
  • Journal Title: JGAA Journal of Graph Algorithms and Applications 13 Pages: 5-18
  • NAID: 110006404226
  • Peer Reviewed
• [Journal Article] A Simple Canonical Code for Fullerene Graphs (2009)
  • Author(s): N.Shimotsuma, S.Nakano
  • Journal Title: 電子情報通信学会英文論文誌A, Vol.E92-A Pages: 3398-2400
  • NAID: 10026862123
  • Peer Reviewed
• [Journal Article] Listing All Plane Graphs (2009)
  • Author(s): K. Yamanaka and S. Nakano
  • Journal Title: JGAA Journal of Graph Algorithnis and Applications (in press)
  • NAID: 110006404226
  • Peer Reviewed
• [Journal Article] 順列の列挙 (2008)
  • Author(s): 関根航人,山中克久,中野眞一
  • Journal Title: 電子情報通信学会論文誌A Vol.J91-A,No.5 Pages: 543-549
  • NAID: 110007382191
  • Peer Reviewed
• [Journal Article] 指定された次数列をもつグラフの列挙 (2008)
  • Author(s): 佐藤圭介,中野眞一
  • Journal Title: 電子情報通信学会論文誌A Vol.J91-A,no.7 Pages: 716-725
  • NAID: 110007384645
  • Peer Reviewed
• [Journal Article] A Compact Encoding of Rectangular Drawings with Efficient Query Supports (2008)
  • Author(s): 山中克久, 中野眞一
  • Journal Title: 電子情報通信学会英文論文誌A,IEICE TRANS.FUNDAMENTALS Vol.E91-A,No.9 Pages: 2284-2291
  • NAID: 10026851296
  • Peer Reviewed
• [Journal Article] 順列の列挙 (2008)
  • Author(s): 関根航人,山中克久,中野眞一
  • Journal Title: 電子情報通信学会論文誌A J91-A,No.5 Pages: 543-549
  • NAID: 110007382191
  • Peer Reviewed
• [Journal Article] 指定された次数列をもつグラフの列挙 (2008)
  • Author(s): 佐藤圭介,中野眞一
  • Journal Title: 電子情報通信学会論文誌A J91-A,no.7 Pages: 716-725
  • NAID: 110007384645
  • Peer Reviewed
• [Journal Article] A Compact Encoding of Rectangular Drawings with Efficient Query Supports (2008)
  • Author(s): K. Yarnanaka and S. Nakano
  • Journal Title: IEICE TRANS. FUNDAMENTALS E91-A, no.9 Pages: 2284-2291
  • NAID: 10026851296
  • Peer Reviewed
• [Journal Article] Efficient Enumeration of Ordered Trees with k leaves
  • Author(s): Katsuhisa Yamanaka, Yota Otachi, Shin-Ichi Nakano
  • Journal Title: Theoretical Computer Science (掲載決定)
  • NAID: 110006980259
  • Peer Reviewed
• [Journal Article] Efficient Enumeration of Ordered Trees with k leaves
  • Author(s): K.Yamanaka, 他2名
  • Journal Title: Theoretical Computer Science Volume: 掲載決定
  • Peer Reviewed
• [Presentation] 矩形描画の圧縮 (2011)
  • Author(s): 中野眞一
  • Organizer: 離散的アルゴリズムの最前線ワークショップ
  • Place of Presentation: かんぽの郷白山尾迎山
  • Year and Date: 2011-02-25
• [Presentation] A Compact encoding of Unordered Binary Trees (2011)
  • Author(s): Kozue Iwata, Shiro Ishiwata, Shin-ichi Nakano
  • Organizer: Proc.of TAMC2011, 8th Annual Conference on Theory and Applications of Models of Computation, LNCS 6648, pp.106-113
  • Place of Presentation: Tokyo(掲載決定)
• [Presentation] Enumerating All Rooted Trees Including k Leaves (2010)
  • Author(s): 石川雅信,山中克久,大舘陽太,中野眞一
  • Organizer: 情報処理学会アルゴリズム研究会2010-AL-131-6
  • Place of Presentation: 函館高専
  • Year and Date: 2010-09-22
• [Presentation] Efficient Enumeration of All Ladder Lotteries with k Bars (2009)
  • Author(s): K.Yamanaka, S.Nakano
  • Organizer: Proc.of The 7th Japan Conference on Computational Geometry and Graphs, JCCGG2009
  • Place of Presentation: 金沢
  • Year and Date: 2009-11-11
• [Presentation] Enumerating All Graphical Sequences (2009)
  • Author(s): Y.Kikuchi, K.Yamanaka, Y.Kikuchi, S.Nakano
  • Organizer: Proc.of The 7th Japan conference on Computational Geometry and Graphs, JCCGG2009
  • Place of Presentation: 金沢
  • Year and Date: 2009-11-11
• [Presentation] k本の横線をもつあみだくじの列挙 (2009)
  • Author(s): 山中克久,中野眞一
  • Organizer: 情報処理学会アルゴリズム研究会2009-AL-126-1
  • Place of Presentation: 鳥取環境大
  • Year and Date: 2009-09-15
• [Presentation] グラフ的列の列挙 (2009)
  • Author(s): 菊地洋右,山中克久,中野眞一
  • Organizer: 情報処理学会アルゴリズム研究会2009-AL-126-2
  • Place of Presentation: 鳥取環境大
  • Year and Date: 2009-09-15
• [Presentation] k本の横線をもつあみだくじの列挙 (2009)
  • Author(s): 山中克久、中野眞一
  • Organizer: 情報処理学会アルゴリズム研究会
  • Place of Presentation: 鳥取環境大
  • Year and Date: 2009-09-15
• [Presentation] グラフ的列の列挙 (2009)
  • Author(s): 菊地洋右, 山中克久、中野眞一
  • Organizer: 情報処理学会アルゴリズム研究会
  • Place of Presentation: 鳥取環境大
  • Year and Date: 2009-09-15
• [Presentation] A Simple Generaton of d-dimensional Partitions (2009)
  • Author(s): Y.Kikuchi, K.Yamanaka, S.Nakano
  • Organizer: Proc.of WAAC 2009,2009Korea-Japan Joint Workshop on Algorithms and Computation
  • Place of Presentation: Seoul, Korea
  • Year and Date: 2009-07-04
• [Presentation] Listing All st-orientations (2009)
  • Author(s): Andry Setiawan, Shin-Ichi Nakano
  • Organizer: 電子情報通信学会コンピュテーション研究会(COMP2009-16)
  • Place of Presentation: 埼玉大大宮ソニックシティカレッジ
  • Year and Date: 2009-05-26
• [Presentation] Listing All st-orientations (2009)
  • Author(s): A.Setiawan, S.Nakano
  • Organizer: 電子情報通信学会コンピュテーション研究会
  • Place of Presentation: 埼玉大大宮ソニックシティカレッジ
  • Year and Date: 2009-05-26
• [Presentation] Efficient Enumeration of All Pseudoline Arrangements (2009)
  • Author(s): K.Yamanaka, S.Nakano, Y.Matsui, R.Uehara, K.Nakada
  • Organizer: 情報処理学会アルゴリズム研究会
  • Place of Presentation: 東大医科学研
  • Year and Date: 2009-05-11
• [Presentation] Efficient Enumeration of All Ladder Lotteries with k Bars (2009)
  • Author(s): 山中克久, 中野眞一
  • Organizer: Proc.of The 7th Japan Conference on Computational Geometry and Graphs, JCCGG2009, pp.63-64
  • Place of Presentation: Kanazawa
• [Presentation] Enumerating All Graphical Sequences (2009)
  • Author(s): Yosuke Kikuchi, Katsuhisa Yamanaka, Shin-Ichi Nakano
  • Organizer: Proc.of The 7th Japan Conference on Computational Geometry and Graphs, JCCGG2009, pp.61-62
  • Place of Presentation: Kanazawa
• [Presentation] A Simple Generation of d-dimensional Partitions (2009)
  • Author(s): Yosuke Kikuchi, Katsuhisa Yamanaka, Shin-Ichi Nakano
  • Organizer: Proc.of WAAC 2009, 2009 Korea-Japan Joint Workshop on Algorithms and Computation pp.60-67
  • Place of Presentation: Seoul,Korea
• [Presentation] Efficient Enumeration of All Pseudoline Arrangements (2009)
  • Author(s): Katsuhisa Yamanaka, Shin-Ichi Nakano, Yasuko Matsui, Ryuhei Uehara, Kento Nakada
  • Organizer: Proc.of EuroCG 2009, pp.143-146
  • Place of Presentation: Brussels, Belgium
• [Presentation] Efficient Generation of Ordered Trees with n Vertices including k leaves (2009)
  • Author(s): Katsuhisa Yamanaka, Yota Otachi, Shin-Ichi Nakano
  • Organizer: Proc.of WALCOM 2009, LNCS, 5431, pp.141-150
  • Place of Presentation: Kolkata,India
• [Presentation] Generating All Triangulations of Plane Graphs (2009)
  • Author(s): Mohammad Tanvir Parvez, Md.Saidur Rahman, Shin-Ichi Nakano
  • Organizer: Proc.of WALCOM 2009, LNCS, 5431, pp.151-164
  • Place of Presentation: Kolkata,India
• [Presentation] Efficient. Generation of Ordered Trees with n Vertices including k leaves (2009)
  • Author(s): Y. Otachi, K. Yamanaka and S. Nakano
  • Organizer: WALCOM 2009
  • Place of Presentation: Kolkata, India
• [Presentation] Generating All Triangulations of Plane Graphs (2009)
  • Author(s): K. Yamanaka, S Nakano,
  • Organizer: WALCOM 2009
  • Place of Presentation: Kolkata, India
• [Presentation] Efficient Enumeration of All Ladder Lotteries (2009)
  • Author(s): K. Yamanaka, S Nakano,他3名
  • Organizer: EuroCG 2009
  • Place of Presentation: Brussels, Belgium
• [Presentation] Efficient Enumeration of All Ladder Lotteries (2008)
  • Author(s): Katsuhisa Yamanaka, Shin-Ichi Nakano, Yasuko Matsui, Ryuhei Uehara, Kento Nakada
  • Organizer: The 20th Workshop on Topological Graph Theory in Yokohama
  • Place of Presentation: 横浜
• [Presentation] Listing All Trees with Specified Degree Sequence (2008)
  • Author(s): 中野眞一
  • Organizer: Kyoto RIMS Workshop on Acceleration and Visualization of Computation for Enumeration Problems
  • Place of Presentation: 京大
• [Presentation] A canonical Coding for Fullerene Graphs (2008)
  • Author(s): 下間直樹,中野眞一
  • Organizer: LAシンポジウム,学生セッション,S6,
  • Place of Presentation: 南紀勝浦
• [Presentation] 2連結平面グラフのst-numberingの列挙 (2008)
  • Author(s): 金子昌弘,中野眞一
  • Organizer: LAシンポジウム,学生セッション,S7
  • Place of Presentation: 南紀勝浦
• [Presentation] Efficient Enumeration of All Ladder Lotteries (2008)
  • Author(s): K. Yamanaka, S Nakano,他3名
  • Organizer: The 20th Workshop on TopologicalGraph Theory in Yokohama
  • Place of Presentation: 横浜