Random Generation of Trees: Random Generators in Computer Science
Laurent Alonso, René Schott (auth.)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.
Beware of he who would deny you access to information, for in his heart he dreams himself your master
Tukar fail
Lebih banyak hasil carian
Faedah lain 
![Donald E. Knuth [Knuth, Donald E.] — The Art of Computer Programming, Volume 3: Sorting and Searching, Second Edition](https://s3proxy.cdn-zlib.se/covers200/collections/userbooks/7509bf013ef6843135b9080ffdc893d0cc8dc4fa327c6360277367ec5c612685.jpg)
![Narasimha Karumanchi [Karumanchi, Narasimha & Karumanchi, Narasimha] — Data Structures and Algorithms Made Easy in Java: Data Structure and Algorithmic Puzzles](https://s3proxy.cdn-zlib.se/covers200/collections/userbooks/daf460a2f01031a90f70da08218b712f60765dbfd4bcb7c8db465a01b9089b16.jpg)
