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

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Ruen Chze Loh' in GoogleThis author has not been identified. Look up 'Sieteng Soh' in GoogleThis author has not been identified. Look up 'Mihai Lazarescu' in GoogleThis author has not been identified. Look up 'Suresh Rai' in Google

runs on WebDSL