The following pages link to (Q3679220):
Displaying 40 items.
- Uniform generation of a Schröder tree (Q293156) (← links)
- On symmetries in phylogenetic trees (Q311529) (← links)
- A simple model of trees for unicellular maps (Q388727) (← links)
- The stable trees are nested (Q389280) (← links)
- An FPT algorithm in polynomial space for the directed Steiner tree problem with limited number of diffusing nodes (Q477657) (← links)
- Scaling limits and influence of the seed graph in preferential attachment trees (Q495132) (← links)
- On trees invariant under edge contraction (Q502560) (← links)
- Counting unicellular maps on non-orientable surfaces (Q550259) (← links)
- Generalized gamma approximation with rates for urns, walks and trees (Q726793) (← links)
- Shapes of topological RNA structures (Q899333) (← links)
- Regenerative tree growth: binary self-similar continuum random trees and Poisson-Dirichlet compositions (Q1035868) (← links)
- Uniform generation of a Motzkin word (Q1341731) (← links)
- The Narayana distribution (Q1347988) (← links)
- A parallel algorithm for the generation of a permutation and applications (Q1351208) (← links)
- A classic proof of a recurrence for a very classical sequence (Q1374205) (← links)
- Scaling limits for some random trees constructed inhomogeneously (Q1748906) (← links)
- Scaling limits of multi-type Markov branching trees (Q2041652) (← links)
- Geometry of weighted recursive and affine preferential attachment trees (Q2042867) (← links)
- Universal limits of substitution-closed permutation classes (Q2216743) (← links)
- Increasing forests and quadrangulations via a bijective approach (Q2341255) (← links)
- A unified approach to polynomial sequences with only real zeros (Q2381831) (← links)
- Efficient random sampling of binary and unary-binary trees via holonomic equations (Q2402673) (← links)
- Convergence of uniform noncrossing partitions toward the Brownian triangulation (Q2632677) (← links)
- Growing random uniform \(d\)-ary trees (Q2694455) (← links)
- (Q5021230) (← links)
- Distributions of restricted rotation distances (Q5045245) (← links)
- Random generation of colored trees (Q5096321) (← links)
- Counting and generating terms in the binary lambda calculus (Q5371959) (← links)
- Almost all Classical Theorems are Intuitionistic (Q5871575) (← links)
- Tuning as convex optimisation: a polynomial tuner for multi-parametric combinatorial samplers (Q5886342) (← links)
- A new family of bijections for planar maps (Q5919631) (← links)
- Bijective recurrences for Motzkin paths (Q5956785) (← links)
- Growing uniform planar maps face by face (Q6063346) (← links)
- Sampling planar tanglegrams and pairs of disjoint triangulations (Q6107829) (← links)
- The Foata-Fuchs proof of Cayley's formula, and its probabilistic uses (Q6110570) (← links)
- A down‐up chain with persistent labels on multifurcating trees (Q6119224) (← links)
- Maximum agreement subtrees and Hölder homeomorphisms between Brownian trees (Q6122622) (← links)
- Stable graphs: distributions and line-breaking construction (Q6159721) (← links)
- Models of random subtrees of a graph (Q6183888) (← links)
- Holonomic equations and efficient random generation of binary trees (Q6599803) (← links)
