Efficient Algorithms for Generating Discrete Structures
| Project/Area Number |
16500005
|
|---|
| 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, Dept.Comp.Sci., Professor, 工学部, 教授 (30227855)
|
|---|
| Project Period (FY) |
2004 – 2005
|
| Project Status |
Completed (Fiscal Year 2005)
|
| Budget Amount *help |
¥3,700,000 (Direct Cost: ¥3,700,000)
Fiscal Year 2005: ¥1,600,000 (Direct Cost: ¥1,600,000)
Fiscal Year 2004: ¥2,100,000 (Direct Cost: ¥2,100,000)
|
|---|
| Keywords | Algorithm / Enumeration / Discrete Structure / Listing |
|---|
| Research Abstract |
Given a property we wish to design algorithms to generate all discrete objects with the property. We wish to efficiently generate all objects without repetitions. This is one of basic problems in computer science, and also frequently arises in many applications, including system test.
For planar structures we have already designed many efficient generating algorithms. Those algorithms are simple and theoretically faster than any known algorithms. The algorithms need only constant number of computations for each object.
In this research we have extended the methods, and designed more general generation algorithms for many non-planar structures. For instance, we have the following result.
Given a poset P, several algorithms have been proposed for generating all linear extensions of P.
We have designed a simple algorithm which generates each linear extension in constant time in worst case. The algorithm is faster than any known algorithm. The known best algorithm generates each linear extension exactly twice and output one of them, while our algorithm, based on a spanning tree structure on a graph, generates each linear extension exactly once.
|
Report
(3 results)
Research Products
(26 results)
