✦ LIBER ✦

Gray Codes, Loopless Algorithm and Partitions

✍ Scribed by Toufik Mansour; Ghalib Nassar

Publisher: Springer Netherlands
Year: 2008
Tongue: English
Weight: 366 KB
Volume: 7
Category: Article
ISSN: 1570-1166
DOI: 10.1007/s10852-008-9086-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

An algorithm for Gray codes

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

Gray code sequences of partitions

✍ Carla D Savage 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 740 KB

Cyclic polytopes, hyperplanes, and Gray

Cyclic polytopes, hyperplanes, and Gray codes

✍ Tibor Bisztriczky; Károly Böröczky, Jr.; DavidS. Gunderson 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 219 KB

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

Ordered partitions and codes generated b

Ordered partitions and codes generated by circulant matrices

✍ R Razen; Jennifer Seberry; K Wehrhahn 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 368 KB