SIAM Digital Library
 
 
 

You are not logged in Logged Out Log In

SIAM J. on Computing / Volume 41 / Issue 1

SIAM J. Comput. 41, pp. 1-11 (11 pages)

Simulating Size-constrained Galton–Watson Trees

Luc Devroye

Full Text: Download PDF | Buy PDF (US$25) | View Cart
We discuss various methods for generating random Galton–Watson trees conditional on their sizes being equal to $n$. A linear expected time algorithm is proposed.

© 2012 Society for Industrial and Applied Mathematics

RELATED DATABASES

To view database links for this article, you need to log in.

KEYWORDS

AMS Subject Headings

65C10, 65C05, 11K45, 68U20

PUBLICATION DATA

ISSN

0097-5397 (print)  
1095-7111 (online)

Publisher

$abstract.society.value is a Member of CrossRef Society for Industrial and Applied Mathematics

ARTICLE DATA

History
Received July 30, 2009
Accepted September 18, 2011
Published online January 03, 2012
Digital Object Identifier
http://dx.doi.org/10.1137/090766632

For access to fully linked references, you need to log in.

Close

Your Recent History Recent History Help

Recently Viewed

  1. Simulating Size-constrained Galton–Watson Trees
  2. Locally Testable Codes Require Redundant Testers
  3. Unique Games with Entangled Provers Are Easy
  4. Programmable Control of Nucleation for Algorithmic Self-Assembly
  5. Faster Integer Multiplication
© SIAM By using SIAM Publications Online you agree to abide by the Terms and Conditions of Use. Banner art adapted from a figure by Hinke M. Osinga and Bernd Krauskopf (University of Bristol, UK).
close