Constant time generation of free trees
SIAM Journal on Computing
Efficient algorithms for listing combinatorial structures
Efficient algorithms for listing combinatorial structures
A Survey of Combinatorial Gray Codes
SIAM Review
Isomorph-free exhaustive generation
Journal of Algorithms
The advantages of forward thinking in generating rooted and free trees
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Foundations of Computer Science
Foundations of Computer Science
Efficient generation of plane trees
Information Processing Letters
Efficient Generation of Plane Triangulations without Repetitions
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Counting the number of independent sets in chordal graphs
Journal of Discrete Algorithms
Distribution of distinguishable objects to bins: generating all distributions
International Journal of Computer Mathematics
Generating all maximal induced subgraphs for hereditary and connected-hereditary graph properties
Journal of Computer and System Sciences
Efficient Enumeration of Ordered Trees with k Leaves (Extended Abstract)
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
Generating All Triangulations of Plane Graphs (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
Generating all distributions of objects to bins
International Journal of Computer Mathematics
Constant Time Generation of Integer Partitions
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Note: Listing closed sets of strongly accessible set systems with applications to data mining
Theoretical Computer Science
Efficient enumeration of all ladder lotteries and its application
Theoretical Computer Science
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
An efficient algorithm for enumerating pseudo cliques
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
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
Output-sensitive listing of bounded-size trees in undirected graphs
ESA'11 Proceedings of the 19th European conference on Algorithms
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
The q-gram distance for ordered unlabeled trees
DS'05 Proceedings of the 8th international conference on Discovery Science
Generation of polyiamonds for p6 tiling by the reverse search
CGGA'10 Proceedings of the 9th international conference on Computational Geometry, Graphs and Applications
Efficient enumeration of ordered trees with k leaves
Theoretical Computer Science
| Hi-index | 0.00 |
Many algorithms to generate all trees with n vertices without repetition are already known. The best algorithm runs in time proportional to the number of trees. However, the time needed to generate each tree may not be bounded by a constant, even though it is “on average”. In this paper we give a simple algorithm to generate all trees with exactly n vertices and diameter d, without repetition. Our algorithm generates each tree in constant time. It also generates all trees so that each tree can be obtained from the preceding tree by at most three operations. Each operation consists of a deletion of a vertex and an addition of a vertex. By using the algorithm for each diameter 2,3,⋯, n−1, we can generate all trees with n vertices.