Ranking and unranking trees using regular reductions

DOI10.1007/3-540-60922-9_47MaRDI QIDQ4593962zbMATH OpenOpenAlexFDO

Authors 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 of partially ordered sets (06A07) Data structures (68P05) Combinatorics in computer science (68R05)

Recommendations

• Ranking and Unranking of Non-regular Trees
• Ranking and Unranking of AVL-Trees
• Ranking and unranking of non-regular trees with a prescribed branching sequence
• scientific article; zbMATH DE number 4008409
• scientific article; zbMATH DE number 4041938

Cited in

(13)

• On generating B-trees with constant average delay and in lexicographic order
• A generic approach for the unranking of labeled combinatorial classes
• scientific article; zbMATH DE number 5844196 (Why is no real title available?)
• Ranking and Unranking of AVL-Trees
• scientific article; zbMATH DE number 4008409 (Why is no real title available?)
• scientific article; zbMATH DE number 4041938 (Why is no real title available?)
• Ranking and Unranking of Non-regular Trees
• scientific article; zbMATH DE number 568846 (Why is no real title available?)
• Two Algorithms for Unranking Arborescences
• Generation, ranking and unranking of ordered trees with degree bounds
• Clean reversible simulations of ranking binary trees
• Ranking and unranking of non-regular trees with a prescribed branching sequence
• Short Note: An Efficient Implementation of Permutation Backtracking in Lexicographic Order

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

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