Pages that link to "Item:Q675311"
From MaRDI portal
The following pages link to A linear-time algorithm for the generation of trees (Q675311):
Displaying 29 items.
- Uniform generation of a Schröder tree (Q293156) (← links)
- Linear-time algorithm for sliding tokens on trees (Q496016) (← links)
- Fast random generation of binary, t-ary and other types of trees (Q582880) (← links)
- Generating binary trees with uniform probability (Q751300) (← links)
- Linear time tree codes (Q799118) (← links)
- Generating binary trees of bounded height (Q1064071) (← links)
- Generating binary trees at random (Q1186567) (← links)
- A linear-time algorithm for the feasibility of pebble motion on trees (Q1283933) (← links)
- Random generation of trees and other combinatorial objects (Q1292293) (← links)
- Uniform random generation of decomposable structures using floating-point arithmetic (Q1292294) (← links)
- Uniform generation of forests of restricted height (Q1330666) (← links)
- Linear-time construction of treaps and Cartesian trees (Q1339378) (← links)
- Uniform generation of a Motzkin word (Q1341731) (← links)
- Generating random binary trees -- a survey (Q1818783) (← links)
- Efficient random sampling of binary and unary-binary trees via holonomic equations (Q2402673) (← links)
- Growing random uniform \(d\)-ary trees (Q2694455) (← links)
- Random-Bit Optimal Uniform Sampling for Rooted Planar Trees with Given Sequence of Degrees and Applications (Q2795938) (← links)
- Uniform Generation of Rooted Ordered Trees with Prescribed Degrees (Q3140121) (← links)
- (Q3187619) (← links)
- Uniformly random tree generation (Q3358769) (← links)
- (Q3819083) (← links)
- A Comparison of Random Binary Tree Generators (Q4415916) (← links)
- A linear algorithm for compact box-drawings of trees (Q4432764) (← links)
- Constant Time Generation of Free Trees (Q4725765) (← links)
- (Q4899527) (← links)
- A linear time algorithm for the feasibility of pebble motion on trees (Q5054818) (← links)
- Random generation of colored trees (Q5096321) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5710816) (← links)
- Growing uniform planar maps face by face (Q6063346) (← links)
