On the generation ofP-sequences

DOI10.1080/00207169108803955zbMath0723.68079OpenAlexW1969122811MaRDI QIDQ3210910

No author found.

Publication date: 1991

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207169108803955

zbMATH Keywords

lexicographic orderbinary treescombinatorial algorithmsA-orderB-orderP-sequencesballot sequences

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items (2)

Generation oft-ary trees with Ballot-sequences^* ⋮ Parallel generation of í-ary trees with ballot-sequences

Cites Work

• Lexicographic generation of ordered trees
• A note on generating binary trees inA-order andB-order
• A numbering system for binary trees
• Generating Binary Trees Lexicographically
• Generation of Binary Trees from Ballot Sequences

This page was built for publication: On the generation ofP-sequences