Open AccessUniform Generation of Rooted Ordered Trees with Prescribed Degrees
Author(s) -
M. D. Atkinson
Publication year - 1993
Publication title -
the computer journal
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.319
H-Index - 64
eISSN - 1460-2067
pISSN - 0010-4620
DOI - 10.1093/comjnl/36.6.593
Subject(s) - simple (philosophy) , tree (set theory) , degree (music) , computer science , mathematics , time complexity , algorithm , combinatorics , philosophy , physics , epistemology , acoustics
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
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom