### Abstract

Given an unreliable communication network, we seek for determining a vertex from the network, the expected number of vertices which connects to is maximum. Such vertex is named the most reliable source (MRS) on the network. The communication failures may occur to links or vertices of the network. The case was generally studied, where no failure happens to each vertex and each link has an independent operational probability. Practically, failures frequently happen to the vertices, including the transmitting fault and receiving fault. Recently, another case is proposed, where each link is steady and each vertex has an independent transmitting probability and receiving probability, and an O(n^{2})time algorithm is presented for computing the MRS on such tree networks with n vertices. In this paper, we propose a faster algorithm for this case, whose time complexity is O(n).

Original language | English (US) |
---|---|

Title of host publication | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |

Pages | 14-23 |

Number of pages | 10 |

Volume | 5573 LNCS |

DOIs | |

State | Published - 2009 |

Event | 3rd International Conference on Combinatorial Optimization and Applications, COCOA 2009 - Huangshan, China Duration: Jun 10 2009 → Jun 12 2009 |

### Publication series

Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|

Volume | 5573 LNCS |

ISSN (Print) | 03029743 |

ISSN (Electronic) | 16113349 |

### Other

Other | 3rd International Conference on Combinatorial Optimization and Applications, COCOA 2009 |
---|---|

Country | China |

City | Huangshan |

Period | 6/10/09 → 6/12/09 |

### Fingerprint

### Keywords

- Most reliable source
- Receiving probability
- Transmitting probability

### ASJC Scopus subject areas

- Computer Science(all)
- Theoretical Computer Science

### Cite this

*Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)*(Vol. 5573 LNCS, pp. 14-23). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5573 LNCS). https://doi.org/10.1007/978-3-642-02026-1_2

**A linear time algorithm for computing the most reliable source on a tree with faulty vertices.** / Ding, Wei; Xue, Guoliang.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).*vol. 5573 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5573 LNCS, pp. 14-23, 3rd International Conference on Combinatorial Optimization and Applications, COCOA 2009, Huangshan, China, 6/10/09. https://doi.org/10.1007/978-3-642-02026-1_2

}

TY - GEN

T1 - A linear time algorithm for computing the most reliable source on a tree with faulty vertices

AU - Ding, Wei

AU - Xue, Guoliang

PY - 2009

Y1 - 2009

N2 - Given an unreliable communication network, we seek for determining a vertex from the network, the expected number of vertices which connects to is maximum. Such vertex is named the most reliable source (MRS) on the network. The communication failures may occur to links or vertices of the network. The case was generally studied, where no failure happens to each vertex and each link has an independent operational probability. Practically, failures frequently happen to the vertices, including the transmitting fault and receiving fault. Recently, another case is proposed, where each link is steady and each vertex has an independent transmitting probability and receiving probability, and an O(n2)time algorithm is presented for computing the MRS on such tree networks with n vertices. In this paper, we propose a faster algorithm for this case, whose time complexity is O(n).

AB - Given an unreliable communication network, we seek for determining a vertex from the network, the expected number of vertices which connects to is maximum. Such vertex is named the most reliable source (MRS) on the network. The communication failures may occur to links or vertices of the network. The case was generally studied, where no failure happens to each vertex and each link has an independent operational probability. Practically, failures frequently happen to the vertices, including the transmitting fault and receiving fault. Recently, another case is proposed, where each link is steady and each vertex has an independent transmitting probability and receiving probability, and an O(n2)time algorithm is presented for computing the MRS on such tree networks with n vertices. In this paper, we propose a faster algorithm for this case, whose time complexity is O(n).

KW - Most reliable source

KW - Receiving probability

KW - Transmitting probability

UR - http://www.scopus.com/inward/record.url?scp=70350650359&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=70350650359&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-02026-1_2

DO - 10.1007/978-3-642-02026-1_2

M3 - Conference contribution

AN - SCOPUS:70350650359

SN - 3642020259

SN - 9783642020254

VL - 5573 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 14

EP - 23

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -