Show simple item record

dc.contributor.authorLoh, Rue-chze
dc.contributor.authorSoh, Sieteng
dc.contributor.authorLazarescu, Mihai
dc.contributor.authorSuresh, R.
dc.contributor.editorNot known
dc.date.accessioned2017-01-30T10:41:39Z
dc.date.available2017-01-30T10:41:39Z
dc.date.created2015-03-03T20:17:31Z
dc.date.issued2008
dc.identifier.citationLoh, 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.urihttp://hdl.handle.net/20.500.11937/4780
dc.publisherIEEE
dc.titleA greedy technique for finding the most reliable edge-disjoint-path-set in a network.
dc.typeConference Paper
dcterms.source.startPage216
dcterms.source.endPage223
dcterms.source.titleThe 14th IEEE Pacific Rim International Symposium on Dependable Computing
dcterms.source.seriesThe 14th IEEE Pacific Rim International Symposium on Dependable Computing
dcterms.source.isbn9780769534480
dcterms.source.conferencePRDC 2008
dcterms.source.conference-start-dateDec 15 2008
dcterms.source.conferencelocationTaiwan
dcterms.source.placeUSA
curtin.departmentDepartment of Computing
curtin.accessStatusFulltext not available


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record