Enumerating Ordered Trees Lexicographically

DOI10.1093/COMJNL/28.5.538MaRDI QIDQ3696535zbMATH OpenOpenAlexFDO

Authors M. C. Er

Publication date 1985

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

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

zbMATH Keywords

binary bit-patternsextended ordered trees

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Lexicographically ordered trees
• Lexicographic Enumeration of k-ary Trees
• Efficient enumeration of ordered trees with \(k\) leaves
• scientific article; zbMATH DE number 3987309
• Short Note: An Efficient Implementation of Permutation Backtracking in Lexicographic Order
• Ordered trees and the inorder traversal
• Efficient Enumeration of Ordered Trees with k Leaves (Extended Abstract)
• Enumeration of binary trees
• Enumerating, Ranking and Unranking Binary Trees
• Enumerating alternating trees

Cited in

(11)

• Generating ordered trees
• Loopless generation of \(k\)-ary tree sequences
• On generating \(k\)-ary trees in computer representation
• Encoding trees by linear recurrence sequences
• Ordered trees and the inorder traversal
• Lexicographic Enumeration of k-ary Trees
• Ranking and Unranking of Non-regular Trees
• Random generation of colored trees
• Clean reversible simulations of ranking binary trees
• Short Note: An Efficient Implementation of Permutation Backtracking in Lexicographic Order
• The rotation -lattice of ternary trees

This page was built for publication: Enumerating Ordered Trees Lexicographically

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