A loopless Gray code for rooted trees

Authors:
James Korsh;Paul Lafollette
Affiliations:
Temple University, Philadelphia, PA;Temple University, Philadelphia, PA
Venue:
ACM Transactions on Algorithms (TALG)
Year:
2006

Citing 12
Cited 1

Generating multiset permutations in constant time

Journal of Algorithms
A Survey of Combinatorial Gray Codes

SIAM Review
On the loopless generation of binary tree sequences

Information Processing Letters
The advantages of forward thinking in generating rooted and free trees

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations

Journal of the ACM (JACM)
A loopless gray-code algorithm for listing k-ary trees

Journal of Algorithms
Efficient generation of the binary reflected gray code and its applications

Communications of the ACM
Loopless generation of up-down permutations

Discrete Mathematics
Generating Bracelets in Constant Amortized Time

SIAM Journal on Computing
A CAT algorithm for generating permutations with a fixed number of inversions

Information Processing Letters
A fast algorithm to generate necklaces with fixed content

Theoretical Computer Science
A loopless algorithm for generating the permutations of a multiset

Theoretical Computer Science - Random generation of combinatorial objects and bijective combinatorics

Combinatorial algorithms for listing paths in minimal change order

CAAN'07 Proceedings of the 4th conference on Combinatorial and algorithmic aspects of networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

Beyer and Hedetniemi [1980] gave the first constant average-time algorithm for the generation of all rooted trees with n nodes. This article presents the first combinatorial Gray code for these trees and a loopless algorithm for its generation.