✦ LIBER ✦

A Gray code for compositions

✍ Scribed by Paul Klingsberg

Publisher: Elsevier Science
Year: 1982
Tongue: English
Weight: 151 KB
Volume: 3
Category: Article
ISSN: 0196-6774
DOI: 10.1016/0196-6774(82)90006-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Loop-Free Gray Code Algorithms for the S

Loop-Free Gray Code Algorithms for the Set of Compositions

✍ Toufik Mansour; Ghalib Nassar 📂 Article 📅 2010 🏛 Springer Netherlands 🌐 English ⚖ 302 KB

A Gray Code for Combinations of a Multis

A Gray Code for Combinations of a Multiset

✍ Frank Ruskey; Carla D. Savage 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 267 KB

An algorithm for Gray codes

✍ S. Mossige 📂 Article 📅 1977 🏛 Springer Vienna 🌐 English ⚖ 154 KB

Gray codes for reflection groups

✍ J. H. Conway; N. J. A. Sloane; Allan R. Wilks 📂 Article 📅 1989 🏛 Springer Japan 🌐 English ⚖ 703 KB

A Gray Code for the Ideals of a Forest P

A Gray Code for the Ideals of a Forest Poset

✍ Y. Koda; F. Ruskey 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 707 KB

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

A Loopless Gray-Code Algorithm for Listi

A Loopless Gray-Code Algorithm for Listing k-ary Trees

✍ Dominique Roelants van Baronaigien 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 91 KB

The bit sequence representation for k-ary trees is a sequence b , b , . . . , b of bits that is formed by doing a preorder traversal of the k-ary tree and writing a 1 when the visited subtree is not empty and a zero when the visited subtree is empty. The representation is well known and in the cas