An exhaustive generation algorithm for Catalan objects and others

zbMATH Open1224.68060arXivmath/0612127MaRDI QIDQ3077255FDOQ3077255

Authors: Antonio Bernini, Irene Fanti, Elisabetta Grazzini 

Publication date: 22 February 2011

Full work available at URL: https://arxiv.org/abs/math/0612127

Recommendations

• scientific article; zbMATH DE number 5562328
• ECO:a methodology for the enumeration of combinatorial objects
• Loopless Algorithms And SchrÖder Trees
• Mathematical Foundations of Computer Science 2003
• Exhaustive generation of combinatorial objects by ECO

zbMATH Keywords

Dyck pathsCatalan objects

Mathematics Subject Classification ID

Combinatorics in computer science (68R05)

Cited In (4)

• Gray codes and lexicographical combinatorial generation for nonnesting and sparse nonnesting set partitions
• Exhaustive generation of positive lattice paths
• Exhaustive generation of some lattice paths and their prefixes
• Generating restricted classes of involutions, Bell and Stirling permutations

This page was built for publication: An exhaustive generation algorithm for Catalan objects and others

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3077255)