Ranking and unranking of B-trees

DOI10.1016/0196-6774(83)90034-2MaRDI QIDQ4747523zbMATH OpenOpenAlexFDO

Authors

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

zbMATH Keywords

algorithmsgeneration of B-treesmultiway treesearch graph

Mathematics Subject Classification ID

Trees (05C05) Searching and sorting (68P10) Graph theory (including graph drawing) in computer science (68R10)

Cited in

(9)

• Generating binary trees of bounded height
• On generating B-trees with constant average delay and in lexicographic order
• On sampling representatives of relational schemas with a functional dependency
• Practical algorithms to rank necklaces, Lyndon words, and de Bruijn sequences
• Ranking and Unranking of Non-regular Trees
• A note on generating binary trees inA-order andB-order
• Fast algorithms for genegrating integer partitions
• Unranking of small combinations from large sets
• Ranking and unranking bordered and unbordered words

This page was built for publication: Ranking and unranking of B-trees

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