Random generation of colored trees

DOI10.1007/3-540-59175-3_78zbMath1495.68160OpenAlexW70107433MaRDI QIDQ5096321

No author found.

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

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (6)

Uniform generation of a Schröder tree ⋮ On the lexicographical generation of compressed codes ⋮ Unnamed Item ⋮ Pattern avoiding partitions and Motzkin left factors ⋮ Generating random binary trees -- a survey ⋮ Random generation of trees and other combinatorial objects

Cites Work

• Algorithm for the generation of nonisomorphic trees
• A linear-time algorithm for the generation of trees
• Lexicographic generation of ordered trees
• Enumerating Ordered Trees Lexicographically
• Constant Time Generation of Rooted Trees
• Coding and generation of nonisomorphic trees
• On the Altitude of Nodes in Random Trees
• Constant Time Generation of Free Trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Random generation of colored trees