Loopless Generation of Schroder Trees

DOI10.1093/COMJNL/46.1.106MaRDI QIDQ4415937zbMATH OpenOpenAlexFDO

Authors James F. Korsh, Paul S. jun. LaFollette

Publication date 7 August 2003

Published in The Computer Journal (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/comjnl/46.1.106

zbMATH Keywords

Schröder numberswell-weighted binary trees

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Loopless Generation of Trees with Specified Degrees
• Loop Free Generation ofK-Ary Trees
• Loopless generation of \(k\)-ary tree sequences
• Loopless Algorithms And SchrÖder Trees
• On the loopless generation of binary tree sequences
• Uniform generation of a Schröder tree
• Shifts and loopless generation of \(k\)-ary trees
• A loopless algorithm for generating binary tree sequences
• Recursive generation of k-ary trees
• A loopless algorithm for generating multiple binary tree sequences simultaneously

Cited in

(6)

• Loopless Algorithms And SchrÖder Trees
• Constant Time Generation of Free Trees
• Schröder's paths and random hierarchies
• Uniform generation of a Schröder tree
• Loopless generation of \(k\)-ary tree sequences
• Listing combinatorial objects in parallel

This page was built for publication: Loopless Generation of Schroder Trees

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