✦ LIBER ✦

An algorithm for Gray codes

✍ Scribed by S. Mossige

Publisher: Springer Vienna
Year: 1977
Tongue: English
Weight: 154 KB
Volume: 18
Category: Article
ISSN: 0010-485X
DOI: 10.1007/bf02248780

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Gray Codes, Loopless Algorithm and Parti

Gray Codes, Loopless Algorithm and Partitions

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

Gray codes for reflection groups

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

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

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 compositions

✍ Paul Klingsberg 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 151 KB

Gray Codes for the Ideals of Interval Or

Gray Codes for the Ideals of Interval Orders

✍ Michel Habib; Lhouari Nourine; George Steiner 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 218 KB

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