Parallel generation of í-ary trees with ballot-sequences

DOI10.1080/09720529.2006.10698074zbMath1103.05084OpenAlexW2072803367MaRDI QIDQ3410896

No author found.

Publication date: 16 November 2006

Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

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

zbMATH Keywords

parallel algorithm

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Generating t-ary trees in A-order
• Lexicographic generation of ordered trees
• On the generation ofP-sequences
• A note on generating binary trees inA-order andB-order
• Generating trees withnnodes andmleaves
• Efficient Generation of k-ary Trees in Natural Order
• Generation of Binary Trees from Ballot Sequences
• Generating t-Ary Trees Lexicographically
• Generation oft-ary trees with Ballot-sequences^*

This page was built for publication: Parallel generation of í-ary trees with ballot-sequences