Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
434002 | Theoretical Computer Science | 2015 | 10 Pages |
Abstract
We present combinatorial Gray codes and explicit designs of efficient algorithms for lexicographical combinatorial generation of the sets of nonnesting and sparse nonnesting set partitions of length n.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Alessandro Conflitti, Ricardo Mamede,