scientific article; zbMATH DE number 434865

zbMATH Open0788.05082MaRDI QIDQ3139714FDOQ3139714

Authors: Ewa Kubicka, Grzegorz Kubicki 

Publication date: 18 November 1993

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

efficient algorithmbinary rooted tree

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)

Cited In (5)

• Constant-memory iterative generation of special strings representing binary trees
• Constant Time Generation of Free Trees
• Generating rooted trees of \(m\) nodes uniformly at random
• Title not available (Why is that?)
• Constant Time Generation of Biconnected Rooted Plane Graphs

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)