Please use this identifier to cite or link to this item:
https://hdl.handle.net/10316/43762| Title: | Gray codes and lexicographical combinatorial generation for nonnesting and sparse nonnesting set partitions | Authors: | Conflitti, Alessandro Mamede, Ricardo |
Issue Date: | 2015 | Publisher: | Elsevier | Project: | PEst-C/MAT/UI0324/2011 | metadata.degois.publication.title: | Theoretical Computer Science | metadata.degois.publication.volume: | 592 | 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. | URI: | https://hdl.handle.net/10316/43762 | DOI: | 10.1016/j.tcs.2015.05.021 10.1016/j.tcs.2015.05.021 |
Rights: | embargoedAccess |
| Appears in Collections: | I&D CMUC - Artigos em Revistas Internacionais |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| gray codes.pdf | 295.92 kB | Adobe PDF | View/Open |
SCOPUSTM
Citations
5
checked on Oct 28, 2024
WEB OF SCIENCETM
Citations
10
5
checked on Oct 2, 2024
Page view(s) 5
1,292
checked on Oct 29, 2024
Download(s)
267
checked on Oct 29, 2024
Google ScholarTM
Check
Altmetric
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.