Analysis of Steiner subtrees of random trees for traceroute algorithms

DOI10.1002/rsa.20263zbMath1207.05181OpenAlexW2950577015MaRDI QIDQ3055772

Philippe Robert, Fabrice M. Guillemin

Publication date: 9 November 2010

Published in: Random Structures and Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.20263

zbMATH Keywords

random treesnetwork discovery problemtraceroute algorithm

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• The oscillatory distribution of distances in random tries
• Distribution of distances in random binary search trees.
• Spanning tree size in random binary search trees.
• A probabilistic analysis of some tree algorithms
• Distribution of the Steiner Distance in Generalized M-ary Search Trees
• On the asymptotic behavior of some algorithms

This page was built for publication: Analysis of Steiner subtrees of random trees for traceroute algorithms