On generating k-ary trees in computer representation

Authors:
Limin Xiang;Kazuo Ushijima;Changjie Tang
Affiliations:
-;-;-
Venue:
Information Processing Letters
Year:
2001

Citing 0
Cited 4

Generating binary trees by Glivenko classes on Tamari lattices

Information Processing Letters
The rotation graph of k-ary trees is Hamiltonian

Information Processing Letters
Ranking and unranking of non-regular trees with a prescribed branching sequence

Mathematical and Computer Modelling: An International Journal
Cool-lex order and k-ary Catalan structures

Journal of Discrete Algorithms

Quantified Score

Hi-index	0.90

Visualization

Abstract