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)
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献