scientific article; zbMATH DE number 3900794

MaRDI QIDQ3679220zbMATH OpenFDO

Authors J. L. Rémy

Publication date 1985

Full work available at URL https://eudml.org/doc/92229

zbMATH Keywords

Catalan numberenumeration of binary treesrandom generation of a binary tree

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Trees (05C05) Enumeration in graph theory (05C30)

Recommendations

• The generation of binary trees as a numerical problem
• On the generation of binary trees from (0–1) codes
• Generating binary trees at random
• Generating random binary trees -- a survey
• Fast random generation of binary, t-ary and other types of trees

Cites work

• A numbering system for binary trees
• Centers of 2–Trees
• Generation of Binary Trees from Ballot Sequences
• scientific article; zbMATH DE number 3677217 (Why is no real title available?)
• scientific article; zbMATH DE number 3690676 (Why is no real title available?)
• scientific article; zbMATH DE number 3720929 (Why is no real title available?)
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• scientific article; zbMATH DE number 3349816 (Why is no real title available?)
• On a correspondence between binary trees and a certain type of permutation

Cited in

(52)

• Regenerative tree growth: binary self-similar continuum random trees and Poisson-Dirichlet compositions
• Uniform generation of a Motzkin word
• The Narayana distribution
• A parallel algorithm for the generation of a permutation and applications
• A classic proof of a recurrence for a very classical sequence
• Scaling limits for some random trees constructed inhomogeneously
• Scaling limits of multi-type Markov branching trees
• Geometry of weighted recursive and affine preferential attachment trees
• Universal limits of substitution-closed permutation classes
• Increasing forests and quadrangulations via a bijective approach
• A unified approach to polynomial sequences with only real zeros
• Efficient random sampling of binary and unary-binary trees via holonomic equations
• Convergence of uniform noncrossing partitions toward the Brownian triangulation
• Growing random uniform d-ary trees
• Uniform generation of a Schröder tree
• On symmetries in phylogenetic trees
• A simple model of trees for unicellular maps
• The stable trees are nested
• Towards a More Precise Analysis of an Algorithm to Generate Binary Trees: A Tutorial
• A note on the generation of binary trees
• The generation of binary trees as a numerical problem
• An FPT algorithm in polynomial space for the directed Steiner tree problem with limited number of diffusing nodes
• Scaling limits and influence of the seed graph in preferential attachment trees
• scientific article; zbMATH DE number 7456060 (Why is no real title available?)
• On trees invariant under edge contraction
• Distributions of restricted rotation distances
• Random generation of colored trees
• scientific article; zbMATH DE number 3895094 (Why is no real title available?)
• Counting and generating terms in the binary lambda calculus
• Counting unicellular maps on non-orientable surfaces
• Almost all Classical Theorems are Intuitionistic
• Tuning as convex optimisation: a polynomial tuner for multi-parametric combinatorial samplers
• Bijective recurrences for Motzkin paths
• Growing uniform planar maps face by face
• Sampling planar tanglegrams and pairs of disjoint triangulations
• The Foata-Fuchs proof of Cayley's formula, and its probabilistic uses
• A down‐up chain with persistent labels on multifurcating trees
• Maximum agreement subtrees and Hölder homeomorphisms between Brownian trees
• Stable graphs: distributions and line-breaking construction
• Scaling Limits of Markov-Branching Trees and Applications
• Models of random subtrees of a graph
• Holonomic equations and efficient random generation of binary trees
• Random generation of source vectors with a fixed preponderant property
• Simple random sampling of binary forests with fixed number of nodes and trees
• Length spectrum of large genus random metric maps
• Simple random sampling of binary forests with fixed number of nodes and trees
• On the edge-density of the Brownian co-graphon and common ancestors of pairs in the CRT
• Continuum asymptotics for tree growth models with uniform backward dynamics
• Generalized gamma approximation with rates for urns, walks and trees
• Up-down ordered Chinese restaurant processes with two-sided immigration, emigration and diffusion limits
• Where do (random) trees grow leaves?
• Shapes of topological RNA structures

This page was built for publication:

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