D.T Lee, C.K Wong
Journal of Algorithms
Algorithms are presented for the ranking, unranking, and generation of all B-trees of order m with n leaves. The algorithms take time proportional to the sizes of their output. It is shown how a search graph can be constructed to aid in the ranking and unranking of B-trees. © 1983.
D.T Lee, C.K Wong
Journal of Algorithms
Shou-Hsuan Stephen Huang, C.K Wong
Journal of Algorithms
D.T Lee, C.K Wong
Journal of Algorithms
J.H Hester, D.S Hirschberg, et al.
Journal of Algorithms