A Linear Time Algorithm for Computing the Most Reliable Source on a Tree with Faulty Vertices

DOI10.1007/978-3-642-02026-1_2zbMath1246.90031OpenAlexW1594568188MaRDI QIDQ3637046

Guoliang Xue, Wei Ding

Publication date: 7 July 2009

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02026-1_2

zbMATH Keywords

most reliable sourcereceiving probabilitytransmitting probability

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Communication networks in operations research (90B18) Reliability, availability, maintenance, inspection in operations research (90B25) Graph algorithms (graph-theoretic aspects) (05C85)

This page was built for publication: A Linear Time Algorithm for Computing the Most Reliable Source on a Tree with Faulty Vertices