𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Note on: “A Linear-Time Algorithm for Computing K -Terminal Reliability in Series-Parallel Network”

✍ Scribed by Satyanarayana, A.; Wood, R. K.; Camarinopoulos, L.; Pampoukis, G.

Book ID
118177362
Publisher
Society for Industrial and Applied Mathematics
Year
1996
Tongue
English
Weight
91 KB
Volume
25
Category
Article
ISSN
0097-5397

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

[Lecture Notes in Computer Science] Math
[Lecture Notes in Computer Science] Mathematical Foundations of Computer Science 2007 Volume 4708 || A Linear Time Algorithm for the k Maximal Sums Problem
✍ Kučera, Luděk; Kučera, Antonín 📂 Article 📅 2007 🏛 Springer Berlin Heidelberg 🌐 English ⚖ 536 KB

This book constitutes the refereed proceedings of the 32nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2007, held in Ceský Krumlov, Czech Republic, August 2007. The 61 revised full papers presented together with the full papers or abstracts of five invited talks add