✦ LIBER ✦

A Gray Code for Combinations of a Multiset

✍ Scribed by Frank Ruskey; Carla D. Savage

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 267 KB
Volume: 17
Category: Article
ISSN: 0195-6698
DOI: 10.1006/eujc.1996.0043

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

A gray code hodoscope and fast buffer fo

A gray code hodoscope and fast buffer for beam particle tagging

✍ D.E. Pellett; J. Erwin; D. Faulkner; W. Ko; R.L. Lander; P.M. Yager 📂 Article 📅 1974 🏛 Elsevier Science ⚖ 525 KB

A Good Method of Combining Codes

✍ Robert Calderbank 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 424 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

An extremal problem for antichains of su

An extremal problem for antichains of subsets of a multiset

✍ G.F. Clements 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 850 KB

A multiset M is a finite set consisting of several different kinds of elements, and an antichain F is a set of incomparable subsets of M. With P and \_F denoting respectively the set of subsets which contain an element of F or are contained in an element of F, we find the best upper bound for min(lF