View Item 

A greedy technique for finding the most reliable edge-disjoint-path-set in a network.

Access Status
Fulltext not available
Authors
Loh, Rue-chze
Soh, Sieteng
Lazarescu, Mihai
Suresh, R.
Date
2008
Type
Conference Paper

Metadata
Show full item record
Citation
Loh, R. and Soh, S. and Lazarescu, M. and Suresh, R. 2008. A greedy technique for finding the most reliable edge-disjoint-path-set in a network., in Not known (ed), PRDC 2008, Dec 15 2008, pp. 216-223. Taiwan: IEEE.
Source Title
The 14th IEEE Pacific Rim International Symposium on Dependable Computing
Source Conference
PRDC 2008
ISBN
School
Department of Computing
URI
Collection