An efficient method of examining all trees

DOI10.1017/S0963548300002157MaRDI QIDQ2785373zbMATH OpenFDO

Authors Ewa Kubicka

Publication date 10 June 1997

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

Full work available at URL https://doi.org/10.1017/S0963548300002157

zbMATH Keywords

algorithmrooted tree

Mathematics Subject Classification ID

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

Recommendations

• Constant Time Generation of Free Trees
• Generating ordered trees
• scientific article; zbMATH DE number 1305528
• Efficient generation of plane trees.
• Uniform Generation of Rooted Ordered Trees with Prescribed Degrees

Cites work

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

Cited in

(4)

• Efficient exploration of faulty trees
• Tree Exploration with an Oracle
• Rooted and unrooted tree-search algorithms
• scientific article; zbMATH DE number 434865 (Why is no real title available?)

This page was built for publication: An efficient method of examining all trees

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