2010 Fiscal Year Final Research Report
Practical encodings of graphs with highly functional query supports
| Project/Area Number |
21700010
|
|---|
| Research Category |
Grant-in-Aid for Young Scientists (B)
|
| Allocation Type | Single-year Grants |
|---|
| Research Field |
Fundamental theory of informatics
|
|---|
| Research Institution | The University of Electro-Communications |
|---|
Principal Investigator |
YAMANAKA Katsuhisa The University of Electro-Communications, 大学院・情報システム学研究科, 助教 (60508836)
|
|---|
| Project Period (FY) |
2009 – 2010
|
| Keywords | アルゴリズム理論 / グラフ理論 / 圧縮アルゴリズム / クエリのサポート |
|---|
| Research Abstract |
We designed encoding algorithms of graphs. We mainly focuses on plane triangulations and grid rectangular drawing, and developed encoding algorithms of them. The algorithm can encode a plane triangulation with compact space and supports the following queries : (1) adjacency, (2) degree, and (3) clockwise neighbour query. The clockwise neighbor query is frequently used in algorithms for plane graphs. Hence it is an extremely practical query. We also developed an algorithm which encodes a grid rectangular drawing with compact space.
|
