A linear time algorithm for computing the most reliable source on a series-parallel graph with unreliable edges

Authors:
Charles J. Colbourn;Guoliang Xue
Affiliations:
The Univ. of Vermont, Burlington;The Univ. of Vermont, Burlington
Venue:
Theoretical Computer Science
Year:
1998

Citing 0
Cited 5

Network location of a reliable center using the most reliable route policy

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

COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
A linear time algorithm for computing a most reliable source on a tree network with faulty nodes

Theoretical Computer Science
A divide-and-conquer algorithm for computing a most reliable source on an unreliable ring-embedded tree

COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
A fast parallel algorithm for finding a most reliable source on a general ring-tree graph with unreliable edges

COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications

Quantified Score

Hi-index	5.23

Visualization

Abstract