Efficient Generation of Rooted Trees
نویسندگان
چکیده
In this paper we give an algorithm to generate all rooted trees with at most n vertices. The algorithm generates each tree in constant time on average. Furthermore the algorithm is simple, and clarifies a simple relation among the trees, that is a family tree of trees, and outputs trees based on the relation.
منابع مشابه
4-PLACEMENT OF ROOTED TREES
A tree T of order n is called k-placement if there are k edge-disjoint copies of T into K_{n}. In this paper we prove some results about 4-placement of rooted trees.
متن کاملConstant Time Generation of Free Trees
An algorithm of Beyer and Hedetniemi for generating unlabeled rooted trees is extended to generate unlabeled free trees. Abstract An algorithm of Beyer and Hedetniemi for generating unlabeled rooted trees is extended to generate unlabeled free trees. “The Beyer-Hedetniemi technique is refined to produce only one member of each equivalence class of rooted trees under isomorphism of the underlyin...
متن کاملNearest Common Ancestors: Universal Trees and Improved Labeling Schemes
We investigate the nearest common ancestor (NCA) function in rooted trees. As the main conceptual contribution, the paper introduces universal trees for the NCA function: For a given family of rooted trees, an NCA-universal tree S is a rooted tree such that any tree T of the family can be embedded into S such that the embedding of the NCA in T of two nodes of T is equal to the NCA in S of the e...
متن کاملMining Frequent Rooted Trees and Free Trees Using Canonical Forms
Tree structures are used extensively in domains such as computational biology, pattern recognition, XML databases, computer networks, and so on. In this paper, we present HybridTreeMiner, a computationally efficient algorithm that discovers all frequently occurring subtrees in a database of rooted unordered trees. The algorithm mines frequent subtrees by traversing an enumeration tree that syst...
متن کاملParallel Generation of t-ary Trees
A parallel algorithm for generating t-ary tree sequences in reverse B-order is presented. The algorithm generates t-ary trees by 0-1 sequences, and each 0-1 sequences is generated in constant average time O(1). The algorithm is executed on a CREW SM SIMD model, and is adaptive and cost-optimal. Prior to the discussion of the parallel algorithm a new sequential generation with O(1) average time ...
متن کامل