The following publications are possibly variants of this publication:
- A Divide-and-Conquer Algorithm for Finding a Most Reliable Source on a Ring-Embedded Tree Network with Unreliable EdgesWei Ding, Guoliang Xue. dmaa, 3(4):503-516, 2011. [doi]
- Linear time algorithms for computing the most reliable source on an unreliable tree networkGuoliang Xue. networks, 30(1):37-45, 1997. [doi]
- A Fast Parallel Algorithm for Finding a Most Reliable Source on a General Ring-Tree Graph with Unreliable EdgesWei Ding, Guoliang Xue. cocoa 2011: 98-112 [doi]
- A Linear Time Algorithm for Computing the Most Reliable Source on a Tree with Faulty VerticesWei Ding, Guoliang Xue. cocoa 2009: 14-23 [doi]
- A Linear Time Algorithm for Computing the Most Reliable Source on a Series-Parallel Graph with Unreliable EdgesCharles J. Colbourn, Guoliang Xue. TCS, 209(1-2):331-345, 1998. [doi]
- A linear time algorithm for computing a most reliable source on a tree network with faulty nodesWei Ding, Guoliang Xue. TCS, 412(3):225-232, 2011. [doi]