Random generation of trees : random generators in computer science
著者
書誌事項
Random generation of trees : random generators in computer science
Kluwer Academic, c1995
大学図書館所蔵 件 / 全16件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
注記
Includes bibliographical references (p. 203-206) and index
内容説明・目次
内容説明
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.
目次
1. Introduction. 2. Notations. 3. Generation of Simple Kinds of Trees. 4. Generation Using Bijective Methods. 5. Generation of Forests of Trees Split into Patterns. 6. Generation of Colored Trees. 7. Two Methods of Generation by Rejection. 8. Arborescences. 9. Generation of Trees with a Given Height and Some Tricks About Complexity. 10. A Parallel Algorithm for the Generation of Words. Appendix 1: Horton--Strahler's Numbers. Appendix 2: Algorithms. Appendix 3: Pictures of Trees. References. Index.
「Nielsen BookData」 より