Saved in:
Bibliographic Details
Main Author: Arndt, Jörg
Format: Preprint
Published: 2014
Subjects:
Online Access:https://arxiv.org/abs/1405.6503
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866929195954733056
author Arndt, Jörg
author_facet Arndt, Jörg
contents We generalize a well-known algorithm for the generation of all subsets of a set in lexicographic order with respect to the sets as lists of elements (subset-lex order). We obtain algorithms for various combinatorial objects such as the subsets of a multiset, compositions and partitions represented as lists of parts, and for certain restricted growth strings. The algorithms are often loopless and require at most one extra variable for the computation of the next object. The performance of the algorithms is very competitive even when not loopless. A Gray code corresponding to the subset-lex order and a Gray code for compositions that was found during this work are described.
format Preprint
id arxiv_https___arxiv_org_abs_1405_6503
institution arXiv
publishDate 2014
record_format arxiv
spellingShingle Subset-lex: did we miss an order?
Arndt, Jörg
Combinatorics
Data Structures and Algorithms
We generalize a well-known algorithm for the generation of all subsets of a set in lexicographic order with respect to the sets as lists of elements (subset-lex order). We obtain algorithms for various combinatorial objects such as the subsets of a multiset, compositions and partitions represented as lists of parts, and for certain restricted growth strings. The algorithms are often loopless and require at most one extra variable for the computation of the next object. The performance of the algorithms is very competitive even when not loopless. A Gray code corresponding to the subset-lex order and a Gray code for compositions that was found during this work are described.
title Subset-lex: did we miss an order?
topic Combinatorics
Data Structures and Algorithms
url https://arxiv.org/abs/1405.6503