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 *help |
¥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.
|
Report
(4 results)
Research Products
(47 results)
-
-
-
-
-
-
-
-
-
-
-
-
-
[Journal Article] 順列の列挙2008
Author(s)
関根航人,山中克久,中野眞一
-
Journal Title
電子情報通信学会論文誌A Vol.J91-A,No.5
Pages: 543-549
NAID
Related Report
Peer Reviewed
-
-
-
[Journal Article] 順列の列挙2008
Author(s)
関根航人,山中克久,中野眞一
-
Journal Title
電子情報通信学会論文誌A J91-A,No.5
Pages: 543-549
NAID
Related Report
Peer Reviewed
-
-
-
-
-
[Presentation] 矩形描画の圧縮2011
Author(s)
中野眞一
Organizer
離散的アルゴリズムの最前線ワークショップ
Place of Presentation
かんぽの郷白山尾迎山
Year and Date
2011-02-25
Related Report
-
-
-
-
-
-
-
-
[Presentation] グラフ的列の列挙2009
Author(s)
菊地洋右, 山中克久、中野眞一
Organizer
情報処理学会アルゴリズム研究会
Place of Presentation
鳥取環境大
Year and Date
2009-09-15
Related Report
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-