Ranking and unranking algorithms for loopless generation of t-ary trees
From MaRDI portal
Publication:3081238
DOI10.1093/jigpal/jzp097zbMath1206.68099OpenAlexW2059552315MaRDI QIDQ3081238
Amin Ahmadi-Adl, Hayedeh Ahrabian, Abbas Nowzari-Dalini
Publication date: 7 March 2011
Published in: Logic Journal of IGPL (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/jigpal/jzp097
\(k\)-ary treesGray-code orderranking algorithmgeneration algorithm\(z\)-sequencesunranking algorithm
Related Items
Gap terminology and related combinatorial properties for AVL trees and Fibonacci-isomorphic trees ⋮ Cool-lex order and \(k\)-ary Catalan structures ⋮ Unnamed Item ⋮ Efficient generation, ranking, and unranking of \((k,m)\)-ary trees in B-order
This page was built for publication: Ranking and unranking algorithms for loopless generation of t-ary trees