Name
Abstract | ||
|---|---|---|
We present a simple O(n) algorithm that generates unifonly a Schroder tree of size n. The basic idea is to choose a slightly enlarged probability space where uniformity can be achieved. (C) 1997 Elsevier Science B.V. |
Year | DOI | Venue |
|---|---|---|
1997 | 10.1016/S0020-0190(97)00174-9 | Inf. Process. Lett. |
Keywords | Field | DocType |
der tree,uniform generation,generation,uniform,linear time,algorithms,computational complexity | Graph theory,Discrete mathematics,Combinatorics,Tree (graph theory),Probability space,Time complexity,Mathematics,Computational complexity theory | Journal |
Volume | Issue | ISSN |
64 | 6 | 0020-0190 |
Citations | PageRank | References |
4 | 0.49 | 7 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| L. Alonso | 1 | 4 | 0.49 |
| Jean-Luc Rémy | 2 | 4 | 1.16 |
| R. Schott | 3 | 4 | 0.49 |