✦ LIBER ✦

On the Longest Paths and the Diameter in Random Apollonian Networks

✍ Scribed by Ebrahimzadeh, Ehsan; Farczadi, Linda; Gao, Pu; Mehrabian, Abbas; Sato, Cristiane M.; Wormald, Nick; Zung, Jonathan

Book ID: 122425259
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 234 KB
Volume: 43
Category: Article
ISSN: 1571-0653
DOI: 10.1016/j.endm.2013.07.053

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The longest path in a network

✍ A.G Azpeitia; David Riley 📂 Article 📅 1970 🏛 Elsevier Science 🌐 English ⚖ 100 KB

The longest path in a random graph

✍ Miklós Ajtai; János Komlós; Endre Szemerédi 📂 Article 📅 1981 🏛 Springer-Verlag 🌐 English ⚖ 571 KB

The Longest Simple Path in a Network

✍ Magne Wathne 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 295 KB

On the expected diameter of random chann

On the expected diameter of random channel networks

✍ Moon, J. W. 📂 Article 📅 1980 🏛 American Geophysical Union 🌐 English ⚖ 146 KB

On approximating the longest path in a g

On approximating the longest path in a graph

✍ D. Karger; R. Motwani; G. D. S. Ramkumar 📂 Article 📅 1997 🏛 Springer 🌐 English ⚖ 962 KB

Approximations for the Disjoint Paths Pr

Approximations for the Disjoint Paths Problem in High-Diameter Planar Networks

✍ Jon Kleinberg; Éva Tardos 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 512 KB

We consider the problem of connecting distinguished terminal pairs in a graph via edge-disjoint paths. This is a classical NP-complete problem for which no general approximation techniques are known; it has recently been brought into focus in papers discussing applications to admission control in hi