scientific article; zbMATH DE number 434865

MaRDI QIDQ3139714zbMATH OpenFDO

Authors Ewa Kubicka, Grzegorz Kubicki

Publication date 18 November 1993

zbMATH Keywords

binary rooted treeefficient algorithm

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Uniform Generation of Rooted Ordered Trees with Prescribed Degrees
• Efficient generation of plane trees.
• A linear-time algorithm for the generation of trees
• Constant Time Generation of Free Trees
• An efficient method of examining all trees

Cited in

(5)

• Constant-memory iterative generation of special strings representing binary trees
• Generating rooted trees of m nodes uniformly at random
• Constant Time Generation of Biconnected Rooted Plane Graphs
• scientific article; zbMATH DE number 4091527 (Why is no real title available?)
• Constant Time Generation of Free Trees

This page was built for publication:

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