A distributional study of the path edge-covering numbers for random trees

13 years 4 months ago

Download info.tuwien.ac.at

Abstract. We study for various tree families the distribution of the number of edgedisjoint 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

Alois Panholzer

Real-time Traffic

DAM 2008 | Edgedisjoint Paths | Tree | Various Tree |

claim paper

» Randomized path coloring on binary trees

» Multivariate FussCatalan numbers

» Weight of a link in a shortest path tree and the Dedekind Eta function

» Nodes of large degree in random trees and forests

» A multivariate view of random bucket digital search trees

» Multiple random walks to uncover short paths in power law networks

» Stability of a Multicast Tree

» Properties of Random Triangulations and Trees

Post Info
More Details (n/a)

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2008
Where	DAM
Authors	Alois Panholzer

Comments (0)

Sciweavers

A distributional study of the path edge-covering numbers for random trees

DAM 2008 | Edgedisjoint Paths | Tree | Various Tree |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers