Random Generation of Trees
Subtitle: Random Generators in Computer Science
By: by Laurent Alonso, René Schott
Contributors: Schott, René
Publisher: Springer US
Published: 1995
Place of publication: Boston, MA
Language: eng
Format: [electronic resource] :
Number of pages: 220
ISBN-13: 9781441951502; 9781475763539
Subjects: Distribution (Probability theory); Information theory; Combinatorial analysis; Computer science
Description: Random Generation of Trees is about a field on the crossroads between computer science, combinatorics and probability theory. Computer scientists need random generators for performance analysis, simulation, image synthesis, etc. In this context random generation of trees is of particular interest. The algorithms presented here are efficient and easy to code. Some aspects of Horton--Strahler numbers, programs written in C and pictures are presented in the appendices. The complexity analysis is done rigorously both in the worst and average cases. Random Generation of Trees is intended for students in computer science and applied mathematics as well as researchers interested in random generation.
Notes: Online full text is restricted to subscribers.

Also available in print.

Mode of access: World Wide Web.