Uniformly random tree generation

DOI10.1049/EL:19911246zbMATH Open0732.05049OpenAlexW2080146079MaRDI QIDQ3358769FDOQ3358769

Authors: John J. Narraway 

Publication date: 1991

Published in: Electronics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1049/el:19911246

Recommendations

• Uniform Generation of Rooted Ordered Trees with Prescribed Degrees
• scientific article; zbMATH DE number 15335
• Random generation of colored trees
• The generation of binary trees as a numerical problem
• A linear-time algorithm for the generation of trees

zbMATH Keywords

probabilitycomplete graphgenerating a uniformly random tree

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Graph algorithms (graph-theoretic aspects) (05C85)

Cited In (9)

• Linking and cutting spanning trees
• Some probabilistic trees with algebraic roots
• Building uniformly random subtrees
• Random generation of colored trees
• Uniform generation of a Schröder tree
• On Generating Random Network Structures: Trees
• Uniform Generation of Rooted Ordered Trees with Prescribed Degrees
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: Uniformly random tree generation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3358769)