Ranking and unranking of B-trees
From MaRDI portal
Publication:4747523
DOI10.1016/0196-6774(83)90034-2zbMath0509.68056MaRDI QIDQ4747523
No author found.
Publication date: 1983
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0196-6774(83)90034-2
05C05: Trees
68P10: Searching and sorting
68R10: Graph theory (including graph drawing) in computer science
Related Items
Generating binary trees of bounded height, On generating B-trees with constant average delay and in lexicographic order, Ranking and Unranking of Non-regular Trees, A note on generating binary trees inA-order andB-order, Fast algorithms for genegrating integer partitions