Ranking and Unranking of 2-3 Trees
From MaRDI portal
Publication:3947134
DOI10.1137/0211049zbMath0486.68060OpenAlexW1978235478MaRDI QIDQ3947134
No author found.
Publication date: 1982
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0211049
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Related Items (6)
Practical algorithms to rank necklaces, Lyndon words, and de Bruijn sequences ⋮ Ranking and unranking bordered and unbordered words ⋮ Ranking and Unranking of Non-regular Trees ⋮ (g//0,g//1,\dots ,g//k)-trees and unary OL systems ⋮ Generating binary trees of bounded height ⋮ On generating B-trees with constant average delay and in lexicographic order
This page was built for publication: Ranking and Unranking of 2-3 Trees
