Name
Abstract | ||
|---|---|---|
A random recursive forest is defined as a union of random recursive trees. We find the expected number of trees in the uniform random recursive forest as well as the number of vertices of given degree, the maximum degree, the height of vertices, the order of branches, the root of the component containing a given vertex, and the last root of such forests. (C) 1994 John Wiley & Sons, Inc. |
Year | DOI | Venue |
|---|---|---|
1994 | 10.1002/rsa.3240050103 | RANDOM STRUCTURES & ALGORITHMS |
Field | DocType | Volume |
Discrete mathematics,Combinatorics,Vertex (geometry),Expected value,Degree (graph theory),Mathematics,Recursion | Journal | 5 |
Issue | ISSN | Citations |
1 | 1042-9832 | 5 |
PageRank | References | Authors |
0.96 | 1 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Krystyna T. Balinska | 1 | 8 | 5.35 |
| Louis V. Quintas | 2 | 22 | 11.30 |
| Jerzy Szymanski | 3 | 36 | 34.38 |