dc.contributor.author | Loh, Rue-chze | |
dc.contributor.author | Soh, Sieteng | |
dc.contributor.author | Lazarescu, Mihai | |
dc.contributor.author | Suresh, R. | |
dc.contributor.editor | Not known | |
dc.date.accessioned | 2017-01-30T10:41:39Z | |
dc.date.available | 2017-01-30T10:41:39Z | |
dc.date.created | 2015-03-03T20:17:31Z | |
dc.date.issued | 2008 | |
dc.identifier.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. | |
dc.identifier.uri | http://hdl.handle.net/20.500.11937/4780 | |
dc.publisher | IEEE | |
dc.title | A greedy technique for finding the most reliable edge-disjoint-path-set in a network. | |
dc.type | Conference Paper | |
dcterms.source.startPage | 216 | |
dcterms.source.endPage | 223 | |
dcterms.source.title | The 14th IEEE Pacific Rim International Symposium on Dependable Computing | |
dcterms.source.series | The 14th IEEE Pacific Rim International Symposium on Dependable Computing | |
dcterms.source.isbn | 9780769534480 | |
dcterms.source.conference | PRDC 2008 | |
dcterms.source.conference-start-date | Dec 15 2008 | |
dcterms.source.conferencelocation | Taiwan | |
dcterms.source.place | USA | |
curtin.department | Department of Computing | |
curtin.accessStatus | Fulltext not available | |