Exhaustive generation of some lattice paths and their prefixes

DOI10.1016/j.tcs.2020.12.013OpenAlexW3112432774MaRDI QIDQ2043010

Elena Barcucci, Antonio Bernini, Renzo Pinzani

Publication date: 22 July 2021

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2020.12.013

zbMATH Keywords

exhaustive generationCAT algorithmMotzkin and Schröder paths

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

Unnamed Item

Uses Software

• OEIS

Cites Work

• Equivalence of the two-dimensional directed animal problem to a one- dimensional path problem
• The random generation of directed animals
• Boltzmann Samplers for the Random Generation of Combinatorial Structures
• Catalan Numbers
• Motzkin numbers
• Motzkin numbers
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Exhaustive generation of some lattice paths and their prefixes