A loopless Gray code for rooted trees-Reference-Cited by-同舟云学术

A loopless Gray code for rooted trees

Published:2006-04 Issue:2 Volume:2 Page:135-152
ISSN:1549-6325
Container-title:ACM Transactions on Algorithms
language:en
Short-container-title:ACM Trans. Algorithms

Author:

Korsh James¹,Lafollette Paul¹

Affiliation:

1. Temple University, Philadelphia, PA

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.

Publisher

Association for Computing Machinery (ACM)

Subject

Mathematics (miscellaneous)

Link

https://dl.acm.org/doi/pdf/10.1145/1150334.1150335

Reference24 articles.

1. Constant time generation of rooted trees;Beyer T.;SIAM J. Computing,1980

2. Efficient generation of the binary reflected gray code and its applications

3. A loop-free algorithm for generating the linear extensions of a poset;Canfield E. R.;Order,1995

4. A CAT algorithm for generating permutations with a fixed number of inversions

5. Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations

Cited by 9 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Amortized efficiency of generation, ranking and unranking left-child sequences in lexicographic order;Discrete Applied Mathematics;2019-09

2. Gray-Code Ranking and Unranking on Left-Weight Sequences of Binary Trees;IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences;2016

3. Amortized Efficiency of Ranking and Unranking Left-Child Sequences in Lexicographic Order;Combinatorial Optimization and Applications;2016

4. Loopless Algorithms for Listing Zaks' Sequences in Gray-Code Order;J INTERNET TECHNOL;2014

5. Ranking and Unranking of Non-regular Trees in Gray-Code Order;IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences;2013