Random Generation of Trees: Random Generators in Computer Science
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.
1103784761
Random Generation of Trees: Random Generators in Computer Science
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.
219.99 In Stock
Random Generation of Trees: Random Generators in Computer Science

Random Generation of Trees: Random Generators in Computer Science

Random Generation of Trees: Random Generators in Computer Science

Random Generation of Trees: Random Generators in Computer Science

Hardcover(1995)

$219.99 
  • SHIP THIS ITEM
    In stock. Ships in 1-2 days.
  • PICK UP IN STORE

    Your local store may have stock of this item.

Related collections and offers


Overview

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.

Product Details

ISBN-13: 9780792395287
Publisher: Springer US
Publication date: 12/31/1994
Edition description: 1995
Pages: 208
Product dimensions: 6.10(w) x 9.25(h) x 0.02(d)

Table of Contents

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.- 2.1 Generation of binary trees: Rimy’s algorithm.- 2.2 Generation of unary-binary trees: Samaj Lareida’s algorithm.- Appendix 3 Pictures of Trees.- References.
From the B&N Reads Blog

Customer Reviews