Constant time generation of free trees
SIAM Journal on Computing
Enumerative combinatorics
Efficient algorithms for listing combinatorial structures
Efficient algorithms for listing combinatorial structures
Isomorph-free exhaustive generation
Journal of Algorithms
Key semantics extraction by dependency tree mining
Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
Generating rooted and free plane trees
ACM Transactions on Algorithms (TALG)
Efficient Enumeration of Ordered Trees with k Leaves (Extended Abstract)
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
Random Generation and Enumeration of Proper Interval Graphs
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
Constant Time Generation of Integer Partitions
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Random Generation and Enumeration of Bipartite Permutation Graphs
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Generation of valid labeled binary trees
ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartI
How to obtain the complete list of caterpillars
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
A new approach to graph recognition and applications to distance-hereditary graphs
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Time and space efficient discovery of maximal geometric graphs
DS'07 Proceedings of the 10th international conference on Discovery science
Efficient algorithms for mining frequent and closed patterns from semi-structured data
PAKDD'08 Proceedings of the 12th Pacific-Asia conference on Advances in knowledge discovery and data mining
Constant time generation of biconnected rooted plane graphs
FAW'10 Proceedings of the 4th international conference on Frontiers in algorithmics
Efficient algorithms for finding frequent substructures from semi-structured data streams
JSAI'03/JSAI04 Proceedings of the 2003 and 2004 international conference on New frontiers in artificial intelligence
Listing triconnected rooted plane graphs
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
A compact encoding of unordered binary trees
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Random generation and enumeration of bipartite permutation graphs
Journal of Discrete Algorithms
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Constant time generation of linear extensions
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
An output-polynomial time algorithm for mining frequent closed attribute trees
ILP'05 Proceedings of the 15th international conference on Inductive Logic Programming
Constant time generation of trees with specified diameter
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Efficient enumeration of ordered trees with k leaves
Theoretical Computer Science
| Hi-index | 0.89 |
A rooted plane tree is a rooted tree with a left-to-right ordering specified for the children of each vertex. In this paper we give a simple algorithm to generate all rooted plane trees with at most n vertices. The algorithm uses O(n) space and generates such trees in O(1) time per tree without duplications. The algorithm does not output entire trees but the difference from the previous tree. By modifying the algorithm we can generate without duplications all rooted plane trees having exactly n vertices in O(1) time per tree, all rooted plane trees having at most n vertices with maximum degree at most D in O(1) time per tree, and all rooted plane trees having exactly n vertices including exactly c leaves in O(n - c) time per tree. Also we can generate without duplications all (non-rooted) plane trees having exactly n vertices in O(n3) time per tree.