Constant Time Generation of Rooted Trees

Cited in

(33)

Computing with B-series
Constant time enumeration of weighted trees
A note on generating binary trees inA-order andB-order
An explicit 16-stage Runge-Kutta method of order 10 discovered by numerical search
Random generation of colored trees
Stable matching games: manipulation via subgraph isomorphism
Efficient enumeration of ordered trees with $k$ leaves
Polynomial-delay generation of functional digraphs up to isomorphism
Fast generation of unlabelled free trees using weight sequences
Large-scale analysis of structural branching measures
Efficient generation of plane trees.
Generation, ranking and unranking of ordered trees with degree bounds
Algorithm for Finding k-Vertex Out-trees and Its Application to k-Internal Out-branching Problem
Faster algorithms for the alignment of sparse correlated Erdős-Rényi random graphs
Homomorphically full graphs
Efficient Enumeration of Ordered Trees with k Leaves (Extended Abstract)
On generating B-trees with constant average delay and in lexicographic order
Listing All Plane Graphs
Efficient generation of triconnected plane triangulations.
A new second‐order conic optimization model for the Euclidean Steiner tree problem in Rd$\mathbb {R}^d$
On the parameterized complexity of vertex cover and edge cover with connectivity constraints
Mathematical optimization models for the Euclidean Steiner tree problem in $\mathbb{R}^d$
Algorithm for finding $k$-vertex out-trees and its application to $k$-internal out-branching problem
Maximizing phylogenetic diversity under ecological constraints: a parameterized complexity study
An efficient method of examining all trees
Linear time tree codes
Algorithmic Pirogov-Sinai theory
Mining frequent closed rooted trees
The generation of random, binary unordered trees
Using classical graph theory to generate non-isomorphic floorplan distributions in the measurement of egress complexity
Sur la génération des arbres binaires par les B-suites
Fast algorithms for genegrating integer partitions
Generating binary trees of bounded height

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3900084)