Random generation of colored trees
From MaRDI portal
Publication:5096321
Recommendations
Cites work
- scientific article; zbMATH DE number 4137767 (Why is no real title available?)
- scientific article; zbMATH DE number 3900794 (Why is no real title available?)
- scientific article; zbMATH DE number 4041938 (Why is no real title available?)
- scientific article; zbMATH DE number 3720929 (Why is no real title available?)
- scientific article; zbMATH DE number 3748431 (Why is no real title available?)
- scientific article; zbMATH DE number 3473265 (Why is no real title available?)
- scientific article; zbMATH DE number 3390779 (Why is no real title available?)
- A linear-time algorithm for the generation of trees
- Algorithm for the generation of nonisomorphic trees
- Coding and generation of nonisomorphic trees
- Constant Time Generation of Free Trees
- Constant Time Generation of Rooted Trees
- Enumerating Ordered Trees Lexicographically
- Lexicographic generation of ordered trees
- On the Altitude of Nodes in Random Trees
Cited in
(9)- On the lexicographical generation of compressed codes
- Graph-Theoretic Concepts in Computer Science
- Generating random binary trees -- a survey
- Pattern avoiding partitions and Motzkin left factors
- Uniform Generation of Rooted Ordered Trees with Prescribed Degrees
- Uniform generation of a Schröder tree
- scientific article; zbMATH DE number 7732110 (Why is no real title available?)
- On generating series of coloured planar trees
- Random generation of trees and other combinatorial objects
This page was built for publication: Random generation of colored trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5096321)