Title :
Uniformly random tree generation
Author_Institution :
New Brunswick Univ., Fredericton, NB, Canada
Abstract :
A simple procedure is described for generating a uniformly random tree in a given graph. The probability of obtaining such a tree in a complete graph is given together with the mean number of edge-set selections required and the associated variance.
Keywords :
probability; trees (mathematics); complete graph; edge-set selections; probability; uniformly random tree; variance;
Journal_Title :
Electronics Letters
DOI :
10.1049/el:19911246
