| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 420612 | Discrete Applied Mathematics | 2008 | 17 Pages |
Abstract
We study for various tree families the distribution of the number of edge-disjoint paths required to cover the edges of a random tree of size n . For all tree families considered we can show a central limit theorem with expectation ∼μn∼μn and variance ∼νn∼νn with constants μμ, νν depending on the specific tree family.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Alois Panholzer,