Uniform generation of a Schröder tree

DOI10.1016/S0020-0190(97)00174-9zbMath1338.68091OpenAlexW2028311751MaRDI QIDQ293156

Jean-Luc Rémy, Laurent Alonso, René Schott

Publication date: 9 June 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019097001749?np=y

zbMATH Keywords

algorithmscomputational complexityuniformitylinear timerejectionSchröder tree

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05)

Related Items (4)

Schröder's paths and random hierarchies ⋮ Random-Bit Optimal Uniform Sampling for Rooted Planar Trees with Given Sequence of Degrees and Applications ⋮ Generating random binary trees -- a survey ⋮ Exchangeable interval hypergraphs and limits of ordered discrete structures

Cites Work

• Unnamed Item
• A linear-time algorithm for the generation of trees
• Uniform generation of a Motzkin word
• A classic proof of a recurrence for a very classical sequence
• Generating trees and the Catalan and Schröder numbers
• Patterns in trees
• Deux propriétés combinatoires des nombres de Schröder
• Bootstrap Percolation, the Schröder Numbers, and theN-Kings Problem
• Random generation of colored trees

This page was built for publication: Uniform generation of a Schröder tree