✦ LIBER ✦

The Swap Edges of a Multiple-Sources Routing Tree

✍ Scribed by Bang Ye Wu; Chih-Yuan Hsiao; Kun-Mao Chao

Book ID: 106148814
Publisher: Springer
Year: 2007
Tongue: English
Weight: 334 KB
Volume: 50
Category: Article
ISSN: 0178-4617
DOI: 10.1007/s00453-007-9080-z

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Finding Best Swap Edges Minimizing the R

Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree

✍ Bilò, Davide; Gualà, Luciano; Proietti, Guido 📂 Article 📅 2012 🏛 Springer 🌐 English ⚖ 769 KB

Swapping a Failing Edge of a Single Sour

Swapping a Failing Edge of a Single Source Shortest Paths Tree Is Good and Fast

✍ Nardelli; Proietti; Widmayer 📂 Article 📅 2002 🏛 Springer 🌐 English ⚖ 267 KB

Multiple use of a shortest route tree fo

Multiple use of a shortest route tree for ordering

✍ Kaveh, A. 📂 Article 📅 1986 🏛 Wiley (John Wiley & Sons) 🌐 English ⚖ 238 KB

Distribution of the Height of a Random T

Distribution of the Height of a Random Tree with Labeled Edges

✍ Sevastyanov, B. A. 📂 Article 📅 1994 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 411 KB

On the uniform edge-partition of a tree

✍ Bang Ye Wu; Hung-Lung Wang; Shih Ta Kuan; Kun-Mao Chao 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 197 KB

The expected length of pendant and inter

The expected length of pendant and interior edges of a Yule tree

✍ Mike Steel; Arne Mooers 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 283 KB

The Yule (pure-birth) model is the simplest null model of speciation; each lineage gives rise to a new lineage independently with the same rate λ. We investigate the expected length of an edge chosen at random from the resulting evolutionary tree. In particular, we compare the expected length of a r