scientific article
From MaRDI portal
Publication:3679220
zbMath0565.05037MaRDI QIDQ3679220
Publication date: 1985
Full work available at URL: https://eudml.org/doc/92229
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Trees (05C05) Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30)
Related Items (40)
Tuning as convex optimisation: a polynomial tuner for multi-parametric combinatorial samplers ⋮ Distributions of restricted rotation distances ⋮ Uniform generation of a Schröder tree ⋮ Uniform generation of a Motzkin word ⋮ Convergence of uniform noncrossing partitions toward the Brownian triangulation ⋮ On symmetries in phylogenetic trees ⋮ The Narayana distribution ⋮ A parallel algorithm for the generation of a permutation and applications ⋮ A unified approach to polynomial sequences with only real zeros ⋮ A classic proof of a recurrence for a very classical sequence ⋮ Efficient random sampling of binary and unary-binary trees via holonomic equations ⋮ A simple model of trees for unicellular maps ⋮ The stable trees are nested ⋮ Random generation of colored trees ⋮ 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 ⋮ Shapes of topological RNA structures ⋮ Stable graphs: distributions and line-breaking construction ⋮ Scaling Limits of Markov-Branching Trees and Applications ⋮ Models of random subtrees of a graph ⋮ Growing random uniform \(d\)-ary trees ⋮ Counting and generating terms in the binary lambda calculus ⋮ Unnamed Item ⋮ Universal limits of substitution-closed permutation classes ⋮ 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 ⋮ On trees invariant under edge contraction ⋮ Scaling limits for some random trees constructed inhomogeneously ⋮ Counting unicellular maps on non-orientable surfaces ⋮ Bijective recurrences for Motzkin paths ⋮ Generalized gamma approximation with rates for urns, walks and trees ⋮ Scaling limits of multi-type Markov branching trees ⋮ Geometry of weighted recursive and affine preferential attachment trees ⋮ A new family of bijections for planar maps ⋮ Regenerative tree growth: binary self-similar continuum random trees and Poisson-Dirichlet compositions ⋮ Increasing forests and quadrangulations via a bijective approach ⋮ Almost all Classical Theorems are Intuitionistic
Cites Work
This page was built for publication:
