Skip Navigation

The Computer Journal 1993 36(6):593-594; doi:10.1093/comjnl/36.6.593
© 1993 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (4)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Atkinson, M. D.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Uniform Generation of Rooted Ordered Trees with Prescribed Degrees

M. D. Atkinson *

School of Computer Science, Carleton University, Ottawa K1S 5B6, Canada

An efficient algorithm is given for generating uniformly at random a rooted tree with a specified number of nodes of each degree. The algorithm requires linear time, needs hardly any auxiliary storage and uses only very simple operations.


* School of Computer Science, Carleton University, Ottawa K1S 5B6, Canada


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.