Constant Time Generation of Rooted Trees
From MaRDI portal
Publication:3900084
DOI10.1137/0209055zbMath0453.05020OpenAlexW2076376787MaRDI QIDQ3900084
Sandra M. Hedetniemi, Terry Beyer
Publication date: 1980
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0209055
Related Items (26)
Algorithm for Finding k-Vertex Out-trees and Its Application to k-Internal Out-branching Problem ⋮ Homomorphically full graphs ⋮ Algorithmic Pirogov-Sinai theory ⋮ Random generation of colored trees ⋮ A new second‐order conic optimization model for the Euclidean Steiner tree problem in Rd$\mathbb {R}^d$ ⋮ Unnamed Item ⋮ Efficient enumeration of ordered trees with \(k\) leaves ⋮ Mining frequent closed rooted trees ⋮ Large-scale analysis of structural branching measures ⋮ Efficient generation of triconnected plane triangulations. ⋮ A note on generating binary trees inA-order andB-order ⋮ On the parameterized complexity of vertex cover and edge cover with connectivity constraints ⋮ Listing All Plane Graphs ⋮ Using classical graph theory to generate non-isomorphic floorplan distributions in the measurement of egress complexity ⋮ An Efficient Method of Examining all Trees ⋮ Algorithm for finding \(k\)-vertex out-trees and its application to \(k\)-internal out-branching problem ⋮ Stable matching games: manipulation via subgraph isomorphism ⋮ Efficient Enumeration of Ordered Trees with k Leaves (Extended Abstract) ⋮ Fast Generation of Unlabelled Free Trees using Weight Sequences ⋮ Efficient generation of plane trees. ⋮ Sur la génération des arbres binaires par les B-suites ⋮ Linear time tree codes ⋮ Generating binary trees of bounded height ⋮ On generating B-trees with constant average delay and in lexicographic order ⋮ Fast algorithms for genegrating integer partitions ⋮ The generation of random, binary unordered trees
This page was built for publication: Constant Time Generation of Rooted Trees
