Practical and functional graph data structures based on graph codings
| Project/Area Number |
25330001
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Multi-year Fund |
|---|
| Section | 一般 |
|---|
| Research Field |
Theory of informatics
|
|---|
| Research Institution | Iwate University |
|---|
Principal Investigator |
|
|---|
| Project Period (FY) |
2013-04-01 – 2016-03-31
|
| Project Status |
Completed (Fiscal Year 2015)
|
| Budget Amount *help |
¥2,080,000 (Direct Cost: ¥1,600,000、Indirect Cost: ¥480,000)
Fiscal Year 2015: ¥780,000 (Direct Cost: ¥600,000、Indirect Cost: ¥180,000)
Fiscal Year 2014: ¥910,000 (Direct Cost: ¥700,000、Indirect Cost: ¥210,000)
Fiscal Year 2013: ¥390,000 (Direct Cost: ¥300,000、Indirect Cost: ¥90,000)
|
|---|
| Keywords | アルゴリズム理論 / グラフ理論 / データ構造 / 符号化 / グラフアルゴリズム / 符号化アルゴリズム / アルゴリズム |
|---|
| Outline of Final Research Achievements |
The purpose of this research is to design data structures for compact representations of graph structures. In this research, we design such data structures by encoding graphs with binary codes. In this project, we focused on representing floorplans, which have application to VLSI design. We presented extremely compact representations for mosaic floorplans and slicing floorplans which are important classes of floorplans.
|
Report
(4 results)
Research Products
(11 results)
