A Simple Algorithm for Generating Non-regular Trees in Lexicographic Order

DOI10.1093/COMJNL/31.1.61zbMATH Open0645.68078OpenAlexW2112790606MaRDI QIDQ3789087FDOQ3789087

Authors: M. C. Er 

Publication date: 1988

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

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

Recommendations

• Generating ordered trees
• Ranking and unranking of non-regular trees with a prescribed branching sequence
• Ranking and Unranking of Non-regular Trees
• scientific article; zbMATH DE number 3961006
• Generating trees withnnodes andmleaves

zbMATH Keywords

codewordsgenerating of non-regular trees in lexicographic order

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Combinatorial codes (94B25)

Cited In (5)

• Ranking and unranking of non-regular trees with a prescribed branching sequence
• Ranking and Unranking of Non-regular Trees
• Generation and enumeration of all solutions of the characteristic sum condition
• On generating B-trees with constant average delay and in lexicographic order
• On the rules for the elimination of the non-canonical Morgan trees

This page was built for publication: A Simple Algorithm for Generating Non-regular Trees in Lexicographic Order

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