The generation of combinatorial objects in a Gray code manner means that the difference between successive objects is small, e.g., one element for subsets or one transposition for permutations of a set. The existence of such Gray codes is often equivalent to an appropriately defined graph on these o
A Gray Code for the Ideals of a Forest Poset
โ Scribed by Y. Koda; F. Ruskey
- Publisher
- Elsevier Science
- Year
- 1993
- Tongue
- English
- Weight
- 707 KB
- Volume
- 15
- Category
- Article
- ISSN
- 0196-6774
No coin nor oath required. For personal study only.
โฆ Synopsis
We present two algorithms for listing all the ideals of a forest poset. These algorithms generate ideals in a gray code manner; that is, consecutive ideals differ by exactly one element. Both algorithms use storage (O(n)), where (n) is the number of elements in the poset. On each iteration, the first algorithm does a partial traversal of the current ideal being listed and runs in time (O(n N)), where (N) is the number of ideals of the poset. The second algorithm mimics the first, but it eliminates the traversal and runs in time (O(N)). This algorithm has the property that the amount of computation between successive ideals is (O(1)); such algorithms are said to be loopless. 1993 Academic Press, Inc.
๐ SIMILAR VOLUMES
## Abstract As natural forest cover declines, planted forests have come to occupy an increasing percentage of the earth's surface, yet we know little about their suitability as alternative habitat for wildlife. Although some primate species use planted forests, few studies have compared primate pop
The Multnomah Foundation for Medical Care has contracted with The Dikewood Corporation to provide systems analysis and automated data processing