Skarbek's Algorithm for t-Ary Trees (original) (raw)
Related papers
Loopless generation of k-ary tree sequences
Information Processing Letters, 1994
A New Algorithm to Represent a Given k-ary Tree into Its Equivalent Binary Tree Structure
Journal of Physical Sciences, 2008
On Succinct Representations of Binary Trees
Mathematics in Computer Science, 2017
An Efficient Scheme for the Generation of Ordered Trees in Constant Amortized Time
2021 15th International Conference on Ubiquitous Information Management and Communication (IMCOM), 2021
Parallel Generation of t-Ary Trees in A-order
The Computer Journal, 2007
Theoretical Computer Science, 1988
Towards a More Precise Analysis of an Algorithm to Generate Binary Trees: A Tutorial
The Computer Journal, 1998
Lexicographic generation of ordered trees
Theoretical Computer Science, 1980
Constructing a binary tree from its traversals
BIT, 1989
Permutation representation of k-ary trees
Theoretical Computer Science, 1985
Loopless Generation of Schroder Trees
The Computer Journal, 2003
An improved algorithm to reconstruct a binary tree from its inorder and postorder traversals
2017
Ultra-succinct representation of ordered trees
2007
Engineering the LOUDS Succinct Tree Representation
Lecture Notes in Computer Science, 2006
Recursive and Nonrecursive Traversal Algorithms for Dynamically Created Binary Trees
A Note on the Reconstruction of a Binary Tree from its Traversals
Information Processing Letters, 1992
Generating binary trees by transpositions
Journal of Algorithms, 1990
2012
Efficient generation of rooted trees
On Parallel Generation of t-Ary Trees in an Associative Model
2001
Bonsai: A compact representation of trees
Software: Practice and Experience, 1993
An optimal algorithm for computing all subtree repeats in trees
Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences, 2014
Iterative Method for Recreating a Binary Tree from its Traversals
International Journal of Computer Applications, 2012
Algorithms for a Bit-Vector Encoding of Trees
2018
Constant Time Generation of Free Trees
SIAM Journal on Computing, 1986
Dynamizing succinct tree representations
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2012
Dynamic Trees in Data Structure
Representing Trees of Higher Degree
Algorithmica, 2005
Efficient implementation of tree skeletons on distributed-memory parallel computers
2006
Succinct Representations of Binary Trees for Range Minimum Queries
Lecture Notes in Computer Science, 2012
Peyman Nasehpour, Henk Koppelaar
Henk Koppelaar, Peyman Nasehpour
Linear-Time Pointer-Machine Algorithms for Path-Evaluation Problems on Trees and Graphs
A logspace algorithm for tree canonization (extended abstract)
Proceedings of the twenty-fourth annual ACM symposium on Theory of computing - STOC '92, 1992