Lexicographic Enumeration of k-ary Trees

DOI10.1080/02522667.1985.10698815zbMath0572.68056OpenAlexW2052815570MaRDI QIDQ3690238

M. C. Er

Publication date: 1985

Published in: Journal of Information and Optimization Sciences (Search for Journal in Brave)

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

zbMATH Keywords

rankingefficient algorithmsunrankingbinary bit-stringsbit-string representation of k-ary trees

Mathematics Subject Classification ID

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

Related Items (2)

Ranking and Unranking of Non-regular Trees ⋮ Staircase tilings and \(k\)-Catalan structures

Cites Work

• Unnamed Item
• Factoring numbers in O(log n) arithmetic steps
• Enumerating Ordered Trees Lexicographically
• A numbering system for binary trees
• Ranking and Listing Algorithms for k-Ary Trees
• Generating t-Ary Trees Lexicographically

This page was built for publication: Lexicographic Enumeration of k-ary Trees