Gray codes and lexicographical combinatorial generation for nonnesting and sparse nonnesting set partitions
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.
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | article |
| Language: | eng |
| Published: |
2015
|
| Online Access: | http://hdl.handle.net/10316/43762 |
| Country: | Portugal |
| Oai: | oai:estudogeral.sib.uc.pt:10316/43762 |