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

Wei Ding, Guoliang Xue

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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(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).

Original languageEnglish (US)
Title of host publicationCombinatorial Optimization and Applications - Third International Conference, COCOA 2009, Proceedings
Pages14-23
Number of pages10
DOIs
StatePublished - Nov 9 2009
Event3rd International Conference on Combinatorial Optimization and Applications, COCOA 2009 - Huangshan, China
Duration: Jun 10 2009Jun 12 2009

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5573 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other3rd International Conference on Combinatorial Optimization and Applications, COCOA 2009
CountryChina
CityHuangshan
Period6/10/096/12/09

Keywords

  • Most reliable source
  • Receiving probability
  • Transmitting probability

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'A linear time algorithm for computing the most reliable source on a tree with faulty vertices'. Together they form a unique fingerprint.

  • Cite this

    Ding, W., & Xue, G. (2009). A linear time algorithm for computing the most reliable source on a tree with faulty vertices. In Combinatorial Optimization and Applications - Third International Conference, COCOA 2009, Proceedings (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