Constant Time Generation of Free Trees

DOI10.1137/0215039zbMath0616.68063OpenAlexW2063643785MaRDI QIDQ4725765

Brendan D. McKay, Robert Alan Wright, Bruce Richmond, Andrew M. Odlyzko

Publication date: 1986

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0215039

zbMATH Keywords

algorithmsuccessor functiontree generationenumeration of treesunrooted tree

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10)

Related Items (21)

Average cost of Duval's algorithm for generating Lyndon words ⋮ Parameterizing role coloring on forests ⋮ Parameterized complexity of categorical clustering with size constraints ⋮ The Distribution of Heights of Binary Trees and Other Simple Trees ⋮ Random generation of colored trees ⋮ A new second‐order conic optimization model for the Euclidean Steiner tree problem in Rd$\mathbb {R}^d$ ⋮ Irreducible contact curves via graph stratification ⋮ Finding Antimagic Labelings of Trees by Evolutionary Search ⋮ Unnamed Item ⋮ Efficient enumeration of ordered trees with \(k\) leaves ⋮ Large-scale analysis of structural branching measures ⋮ Efficient generation of triconnected plane triangulations. ⋮ Parameterized complexity of categorical clustering with size constraints ⋮ Listing All Plane Graphs ⋮ Enumerating models of DNF faster: breaking the dependency on the formula size ⋮ An initial study of time complexity in infinite-domain constraint satisfaction ⋮ An Efficient Method of Examining all Trees ⋮ Efficient Enumeration of Ordered Trees with k Leaves (Extended Abstract) ⋮ Fast Generation of Unlabelled Free Trees using Weight Sequences ⋮ Efficient generation of plane trees. ⋮ On generating B-trees with constant average delay and in lexicographic order

This page was built for publication: Constant Time Generation of Free Trees