✦ LIBER ✦

A linear time algorithm for computing a most reliable source on a tree network with faulty nodes

✍ Scribed by Wei Ding; Guoliang Xue

Book ID: 111713784
Publisher: Elsevier Science
Year: 2011
Tongue: English
Weight: 305 KB
Volume: 412
Category: Article
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2009.08.003

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Linear time algorithms for computing the

Linear time algorithms for computing the most reliable source on an unreliable tree network

✍ Xue, Guoliang 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 121 KB 👁 2 views

Given a tree network with n vertices where each edge has an operational probability, we are interested in finding a vertex on the tree whose expected number of reachable vertices is maximum. This problem was studied in Networks 27 (1996) 219-237, where an O(n 3 ) time algorithm and an O(n 2 ) time a

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

Note on: “A Linear-Time Algorithm for Co

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

✍ Satyanarayana, A.; Wood, R. K.; Camarinopoulos, L.; Pampoukis, G. 📂 Article 📅 1996 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 91 KB

A linear-time algorithm for computing K-

A linear-time algorithm for computing K-terminal reliability on proper interval graphs

✍ Min-Sheng Lin 📂 Article 📅 2002 🏛 IEEE 🌐 English ⚖ 288 KB

[IEEE 2011 International Conference on N

[IEEE 2011 International Conference on Network Computing and Information Security (NCIS) - Guilin, China (2011.05.14-2011.05.15)] 2011 International Conference on Network Computing and Information Security - A Fixed Point Algorithm for Noisy Time-Dependent Processes Using AR Source Model

✍ Yang, Yumin 📂 Article 📅 2011 🏛 IEEE ⚖ 322 KB

[ACM Press the twenty-fifth annual ACM s

[ACM Press the twenty-fifth annual ACM symposium - San Diego, California, United States (1993.05.16-1993.05.18)] Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 - A linear time algorithm for finding tree-decompositions of small treewidth

✍ Bodlaender, Hans L. 📂 Article 📅 1993 🏛 ACM Press ⚖ 833 KB