Enumerating \(k\)-way trees
type: Item
instance of: scholarly article
title: Enumerating \(k\)-way trees
zbMATH Open document ID: 0793.68045
DOI: 10.1016/0020-0190(93)90180-H
author: V. Pereyra
published in: Information Processing Letters
publication date: 1994-02-24T00:00:00Z
review text: 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.
reviewed by: Jozef Vyskoč
Mathematics Subject Classification ID: 68P05
Mathematics Subject Classification ID: 68R05
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05A15
zbMATH DE Number: 500551
zbMATH Keywords: data structures
zbMATH Keywords: trees
MaRDI profile type: Publication
cites work: Proofs as programs
cites work: Q4692467
cites work: Q5585020
cites work: Q3935355
cites work: Counting and randomly generating binary trees
cites work: Q3992671
cites work: Functional Composition Patterns and Power Series Reversion
full work available at URL: 0020-0190(93)90180-h
OpenAlex ID: W2070793304
description: scientific article; zbMATH DE number 500551