Generating binary trees by Glivenko classes on Tamari lattices
Information Processing Letters
The rotation graph of k-ary trees is Hamiltonian
Information Processing Letters
Generation of valid labeled binary trees
ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartI
Hi-index | 0.89 |