A Greedy Technique for Finding the Most Reliable Edge-Disjoint-Path-Set in a Network

Ruen Chze Loh, Sieteng Soh, Mihai Lazarescu, Suresh Rai. A Greedy Technique for Finding the Most Reliable Edge-Disjoint-Path-Set in a Network. In 14th IEEE Pacific Rim International Symposium on Dependable Computing, PRDC 2008, 15-17 December 2008, Taipei, Taiwan. pages 216-223, IEEE Computer Society, 2008. [doi]

Abstract

Abstract is missing.