Designing highly functional and practical coding-algorithms of plane graphs
| Project/Area Number |
23700012
|
|---|
| Research Category |
Grant-in-Aid for Young Scientists (B)
|
| Allocation Type | Multi-year Fund |
|---|
| Research Field |
Fundamental theory of informatics
|
|---|
| Research Institution | Iwate University |
|---|
Principal Investigator |
|
|---|
| Project Period (FY) |
2011 – 2012
|
| Project Status |
Completed (Fiscal Year 2012)
|
| Budget Amount *help |
¥1,560,000 (Direct Cost: ¥1,200,000、Indirect Cost: ¥360,000)
Fiscal Year 2012: ¥910,000 (Direct Cost: ¥700,000、Indirect Cost: ¥210,000)
Fiscal Year 2011: ¥650,000 (Direct Cost: ¥500,000、Indirect Cost: ¥150,000)
|
|---|
| Keywords | アルゴリズム理論 / グラフ理論 / 符号化アルゴリズム |
|---|
| Research Abstract |
In this research, we have designed some coding algorithms for important subclasses of plane graphs. First, we define a subclass of ordered trees which has a 1-to-1 correspondence to a class of rooted trees, and design a compact code for such ordered tree. For grid rectangular drawings and mosaic floorplans, which have applications to VLSI design, we proposed some compact codes. We also proposed a compact code for optimal ladder lotteries. Using the code, we give an upper bound for the number of optimal ladder lotteries.
|
Report
(3 results)
Research Products
(13 results)
-
-
-
-
-
-
[Presentation] Coding ladder lotteries2013
Author(s)
Tomoki Aiuchi, Katsuhisa Yamanaka, Takashi Hirayama, and Yasuaki Nishitani
Organizer
European Workshop on Computational Geometory(EuroCG 2013)
Place of Presentation
House of Science(ドイツ,ブラウンシュバイク)
Year and Date
2013-03-19
Related Report
-
-
-
-
-
-
-
