Abstract
Purchase PDF (689 K)
E-mail Article
Add to my Quick Links
Cited By in Scopus (12)
Purchase PDF (464 K)
) time and space, after a preprocessing phase of 
doi:10.1016/S0304-3975(98)00322-3 
Copyright © 1999 Published by Elsevier Science B.V.
Contribution
Random generation of trees and other combinatorial objects
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Available online 24 June 1999.
Abstract
In this paper, we present a general method for the random generation of some classes of combinatorial objects. Our basic idea is to translate ECO method (Enumerating Combinatorial Objects) from a method for the enumeration of combinatorial objects into a random generation method. The algorithms we illustrate are based on the concepts of succession rule and generating tree: the former is a law that predicts the combinatorial object class growth according to a given parameter. The generating tree related to a given succession rule is a particular labelled plane tree that represents the rule in an extensive way. Each node of a generating tree can also be seen as a particular combinatorial object and so a random path in the generating tree coincides with the random generation of that combinatorial object. The generation is uniform if we take the probability of each branch to be selected into account when the path is generated. We also give the formulae evaluating complexity. Finally, we take the class of m-ary trees into consideration in order to illustrate our general method. In this case, the average time complexity of the generating algorithm can be estimated as O(mn).
