Ranking and unranking trees using regular reductions

DOI10.1007/3-540-60922-9_47zbMath1379.68248OpenAlexW1573310225MaRDI QIDQ4593962

Pierre Kelsen

Publication date: 16 November 2017

Published in: STACS 96 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-60922-9_47

Mathematics Subject Classification ID

Trees (05C05) Combinatorics in computer science (68R05) Combinatorics of partially ordered sets (06A07) Data structures (68P05)

Related Items (1)

On generating B-trees with constant average delay and in lexicographic order

This page was built for publication: Ranking and unranking trees using regular reductions