A greedy technique for finding the most reliable edge-disjoint-path-set in a network.
| Main Authors: | , , , |
|---|---|
| Other Authors: | |
| Format: | Conference Paper |
| Published: |
IEEE
2008
|
| Online Access: | http://hdl.handle.net/20.500.11937/4780 |
| _version_ | 1848744612273848320 |
|---|---|
| author | Loh, Rue-chze Soh, Sieteng Lazarescu, Mihai Suresh, R. |
| author2 | Not known |
| author_facet | Not known Loh, Rue-chze Soh, Sieteng Lazarescu, Mihai Suresh, R. |
| author_sort | Loh, Rue-chze |
| building | Curtin Institutional Repository |
| collection | Online Access |
| first_indexed | 2025-11-14T06:04:14Z |
| format | Conference Paper |
| id | curtin-20.500.11937-4780 |
| institution | Curtin University Malaysia |
| institution_category | Local University |
| last_indexed | 2025-11-14T06:04:14Z |
| publishDate | 2008 |
| publisher | IEEE |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | curtin-20.500.11937-47802017-02-28T01:29:47Z A greedy technique for finding the most reliable edge-disjoint-path-set in a network. Loh, Rue-chze Soh, Sieteng Lazarescu, Mihai Suresh, R. Not known 2008 Conference Paper http://hdl.handle.net/20.500.11937/4780 IEEE restricted |
| spellingShingle | Loh, Rue-chze Soh, Sieteng Lazarescu, Mihai Suresh, R. A greedy technique for finding the most reliable edge-disjoint-path-set in a network. |
| title | A greedy technique for finding the most reliable edge-disjoint-path-set in a network. |
| title_full | A greedy technique for finding the most reliable edge-disjoint-path-set in a network. |
| title_fullStr | A greedy technique for finding the most reliable edge-disjoint-path-set in a network. |
| title_full_unstemmed | A greedy technique for finding the most reliable edge-disjoint-path-set in a network. |
| title_short | A greedy technique for finding the most reliable edge-disjoint-path-set in a network. |
| title_sort | greedy technique for finding the most reliable edge-disjoint-path-set in a network. |
| url | http://hdl.handle.net/20.500.11937/4780 |