✦ LIBER ✦

Addressing the Most Reliable Edge-Disjoint Paths With a Delay Constraint

✍ Scribed by Loh, R.C.; Soh, S.; Lazarescu, M.

Book ID: 114668888
Publisher: IEEE
Year: 2011
Tongue: English
Weight: 291 KB
Volume: 60
Category: Article
ISSN: 0018-9529
DOI: 10.1109/tr.2010.2103592

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The maximal size of graphs with at most

The maximal size of graphs with at most k edge-disjoint paths connecting any two adjacent vertices

✍ Mao-cheng Cai 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 502 KB

Let n and k be positive integers satisfying k + 1 s n s 3k -1, and G a simple graph of order n and size e(G) with at most k edge-disjoint paths connecting any two adjacent vertices. In this paper we prove that e(G) s l(n + k)\*/8], and give complete characterizations of the extremal graphs and the e

Finding the most reliable path with and

Finding the most reliable path with and without link travel time correlation: A Lagrangian substitution based approach

✍ Tao Xing; Xuesong Zhou 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 984 KB

A linear time algorithm for computing th

A linear time algorithm for computing the most reliable source on a series-parallel graph with unreliable edges

✍ Charles J. Colbourn; Guoliang Xue 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 993 KB

Given a network with n vertices and m edges where each edge has an independent operational probability, we are interested in finding a vertex of the network whose expected number of reachable vertices is maximum. Such a vertex is called a most reliable source of the network. This problem was studied