2007 Fiscal Year Final Research Report Summary
Compact Encodings of Graphs with Efficient Query Support
| Project/Area Number |
18500002
|
|---|
| 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 Shin-ichi Gunma University, Faculty of Engineering, Professor (30227855)
|
|---|
| Project Period (FY) |
2006 – 2007
|
| Keywords | Algorithm / Graph / Coding / Compact Representation / Query |
|---|
| Research Abstract |
A rectangular drawing is a plane drawing in which every face is a rectangle. We have designed a simple encoding scheme for rectangular drawings as follows. Given a rectangular drawing R with maximum degree 3, our scheme encodes R with 5m/3 + o (n) bits for each n-vertex rectangular drawing R, where m is the number of edges of R, and supports a rich set of queries, including adjacency and degree queries on the faces, in constant time.
Also we have designed efficient enumeration algorithms for 4 connected maximal plane graphs, and connected plane graphs, in which we have designed a compact coding for each class of graphs.
|
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
[Presentation] Listing All Plane Graphs2008
Author(s)
Katsuhisa Yamanaka and Shin-Ichi Nakano
Organizer
Proc. of WALCOM 2008, LNCS, 4921 (210-221 (2008))
Place of Presentation
Dhaka, Bangladesh
Year and Date
20080207-08
Description
「研究成果報告書概要(欧文)」より
-
-
-
-
-
-
-
-
-
-
-
[Presentation] Constant Time Generation of Integer Partitions2006
Author(s)
Katsuhisa Yamanaka, Shin-ichiro Kawano, Yosuke Kikuchi and Shin-ichi Nakano
Organizer
WAAC06, The 9th Japan-Korea Joint Workshop on Algorithms and Computation
Place of Presentation
Hokkaido University, Sapporo, Japan
Year and Date
20060704-05
Description
「研究成果報告書概要(和文)」より
-
