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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
