On the 2‐MRS Problem in a Tree with Unreliable Edges

Wei Ding, Yu Zhou, Guangting Chen, Hongfa Wang and Guangming Wang

Journal of Applied Mathematics, 2013, vol. 2013, issue 1

Abstract: This paper extends the well‐known most reliable source (1‐MRS) problem in unreliable graphs to the 2‐most reliable source (2‐MRS) problem. Two kinds of reachable probability models of node pair in unreliable graphs are considered, that is, the superior probability and united probability. The 2‐MRS problem aims to find a node pair in the graph from which the expected number of reachable nodes or the minimum reachability is maximized. It has many important applications in large‐scale unreliable computer or communication networks. The #P‐hardness of the 2‐MRS problem in general graphs follows directly from that of the 1‐MRS problem. This paper deals with four models of the 2‐MRS problem in unreliable trees where every edge has an independent working probability and devises a cubic‐time and quadratic‐space dynamic programming algorithm, respectively, for each model.

Date: 2013
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1155/2013/743908

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:jnljam:v:2013:y:2013:i:1:n:743908

Access Statistics for this article

More articles in Journal of Applied Mathematics from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().