Random generation of colored trees
From MaRDI portal
Publication:5096321
DOI10.1007/3-540-59175-3_78zbMATH Open1495.68160OpenAlexW70107433MaRDI QIDQ5096321FDOQ5096321
Authors:
Publication date: 16 August 2022
Published in: LATIN '95: Theoretical Informatics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-59175-3_78
Recommendations
Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A linear-time algorithm for the generation of trees
- Lexicographic generation of ordered trees
- On the Altitude of Nodes in Random Trees
- Title not available (Why is that?)
- Constant Time Generation of Rooted Trees
- Constant Time Generation of Free Trees
- Algorithm for the generation of nonisomorphic trees
- Coding and generation of nonisomorphic trees
- Enumerating Ordered Trees Lexicographically
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (9)
- On the lexicographical generation of compressed codes
- Generating random binary trees -- a survey
- Title not available (Why is that?)
- Uniform generation of a Schröder tree
- Uniform Generation of Rooted Ordered Trees with Prescribed Degrees
- Pattern avoiding partitions and Motzkin left factors
- Graph-Theoretic Concepts in Computer Science
- 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)
