Random Generation of Trees: Random Generators in Computer Science
Author:   Laurent Alonso ,  René Schott
Publisher:   Springer
Edition:   1995 ed.
ISBN:  

9780792395287


Pages:   208
Publication Date:   31 December 1994
Format:   Hardback
Availability:   In Print   Availability explained
This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us.

Our Price $736.56 Quantity:  
Add to Cart

Share |

Random Generation of Trees: Random Generators in Computer Science


Overview

This text 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. 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. The book is intended for students in computer science and applied mathematics as well as researchers interested in random generation.

Full Product Details

Author:   Laurent Alonso ,  René Schott
Publisher:   Springer
Imprint:   Springer
Edition:   1995 ed.
Dimensions:   Width: 15.50cm , Height: 1.40cm , Length: 23.50cm
Weight:   1.090kg
ISBN:  

9780792395287


ISBN 10:   079239528
Pages:   208
Publication Date:   31 December 1994
Audience:   College/higher education ,  Professional and scholarly ,  Postgraduate, Research & Scholarly ,  Professional & Vocational
Format:   Hardback
Publisher's Status:   Active
Availability:   In Print   Availability explained
This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us.

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.

Reviews

Author Information

Tab Content 6

Author Website:  

Countries Available

All regions
Latest Reading Guide

ARG20253

 

Shopping Cart
Your cart is empty
 Shopping cart
Mailing List

 

Sign up now