Enumerating \(k\)-way trees (Q1313764)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Enumerating \(k\)-way trees |
scientific article; zbMATH DE number 500551
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Enumerating \(k\)-way trees |
scientific article; zbMATH DE number 500551 |
Statements
Enumerating \(k\)-way trees (English)
0 references
24 February 1994
0 references
A matrix representation of a \(k\)-way tree is described and used to prove a theorem on the number of \(k\)-way trees with a prescribed number of edges in each direction. The theorem is then used to give a simple proof of Cayley's theorem on the number of free labelled trees on \(n\) nodes. In addition, efficient algorithm to generate arbitrary \(k\)-way trees uniformly at random is outlined.
0 references
data structures
0 references
trees
0 references
