✦ LIBER ✦

Complexity of resilient network optimisation

✍ Scribed by Żotkiewicz, Mateusz ;Pióro, Michał ;Tomaszewski, Artur

Publisher: John Wiley and Sons
Year: 2009
Tongue: English
Weight: 127 KB
Volume: 20
Category: Article
ISSN: 1124-318X
DOI: 10.1002/ett.1371

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the complexity of resilient network d

On the complexity of resilient network design

✍ Artur Tomaszewski; Michał Pióro; Mateusz Żotkiewicz 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 354 KB

Resilient dimensioning of proportionally

Resilient dimensioning of proportionally fair networks

✍ Pióro, Michał ;Kubilinskas, Eligijus ;Nilsson, Pål 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 185 KB

Resilient and adaptive defense of comput

Resilient and adaptive defense of computing networks

✍ Robert Ghanea-Hercock 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 43 KB

Complexity Analysis of Yeast Proteome Ne

Complexity Analysis of Yeast Proteome Network

✍ Danail Bonchev 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 208 KB

Minimizing the complexity of an activity

Minimizing the complexity of an activity network

✍ Jerzy Kamburowski; David J. Michael; Matthias F.M. Stallmann 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 150 KB 👁 3 views

On the Complexity of Distributed Network

On the Complexity of Distributed Network Decomposition

✍ Alessandro Panconesi; Aravind Srinivasan 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 200 KB

In this paper, we improve the bounds for computing a network decomposition Ž ⑀ Ž n. ⑀ Ž n. . distributively and deterministically. Our algorithm computes an n , n - ## Ž . decomposition in n time, where ⑀ n s 1r log n . As a corollary we obtain ' improved deterministic bounds for distributively c