Building uniformly random subtrees

This publication has 17 references indexed in Scilit:

• Generating functions for generating trees
  Discrete Mathematics, 2002
• Random generation of trees and other combinatorial objects
  Theoretical Computer Science, 1999
• Conceptual Proofs of $L$ Log $L$ Criteria for Mean Behavior of Branching Processes
  The Annals of Probability, 1995
• A calculus for the random generation of labelled combinatorial structures
  Theoretical Computer Science, 1994
• The generation of binary trees as a numerical problem
  Journal of the ACM, 1992
• The Cycle Lemma and Some Applications
  European Journal of Combinatorics, 1990
• The Infinite Self-Avoiding Walk in High Dimensions
  The Annals of Probability, 1989
• The morphology of partially ordered sets
  Journal of Combinatorial Theory, Series A, 1974
• Functional Composition Patterns and Power Series Reversion
  Transactions of the American Mathematical Society, 1960
• Functional composition patterns and power series reversion
  Transactions of the American Mathematical Society, 1960