Enumerating Ordered Trees Lexicographically

DOI10.1093/comjnl/28.5.538zbMath0576.68053OpenAlexW2141911672MaRDI QIDQ3696535

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)

Related Items (7)

Loopless generation of \(k\)-ary tree sequences ⋮ Random generation of colored trees ⋮ Clean Reversible Simulations of Ranking Binary Trees ⋮ Encoding trees by linear recurrence sequences ⋮ Ranking and Unranking of Non-regular Trees ⋮ On generating \(k\)-ary trees in computer representation ⋮ Lexicographic Enumeration of k-ary Trees

This page was built for publication: Enumerating Ordered Trees Lexicographically