Author:
Durocher Stephane,Li Pak Ching,Mondal Debajyoti,Williams Aaron
Publisher
Springer Berlin Heidelberg
Reference10 articles.
1. Canfield, E., Williamson, S.: A loop-free algorithm for generating the linear extensions of a poset. Order 12, 57–75 (1995)
2. Heubach, S., Li, N.Y., Mansour, T.: A garden of k-Catalan structures (2008),
http://www.scientificcommons.org/43469719
3. Knuth, D.E.: The Art of Computer Programming: Generating all Trees and History of Combinatorial Generation, vol. 4. Addison-Wesley (2006)
4. Pruesse, G., Ruskey, F.: Generating the linear extensions of certain posets by transpositions. SIAM Journal on Discrete Mathematics 4(3), 413–422 (1991)
5. Ruskey, F.: Generating t-ary trees lexicographically. SIAM Journal on Computing 7(4), 424–439 (1978)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A Shift Gray Code for Fixed-Content Łukasiewicz Words;Lecture Notes in Computer Science;2022
2. Binary bubble languages and cool-lex order;Journal of Combinatorial Theory, Series A;2012-01