An Efficient Method of Examining all Trees

DOI10.1017/S0963548300002157zbMath0863.05025MaRDI QIDQ2785373

Ewa M. Kubicka

Publication date: 10 June 1997

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

zbMATH Keywords

algorithmrooted tree

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• The distribution of degrees in a large random tree
• On the average number of nodes in a subtree of a tree
• Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische Verbindungen
• Constant Time Generation of Rooted Trees
• Constant Time Generation of Free Trees

This page was built for publication: An Efficient Method of Examining all Trees