dc.contributor.author | Guo, H | en_US |
dc.contributor.author | Jerrum, M | en_US |
dc.date.accessioned | 2019-06-11T09:32:06Z | |
dc.date.available | 2019-01-23 | en_US |
dc.date.issued | 2019 | en_US |
dc.identifier.issn | 0097-5397 | en_US |
dc.identifier.uri | https://qmro.qmul.ac.uk/xmlui/handle/123456789/57919 | |
dc.format.extent | 964 - 978 | en_US |
dc.relation.ispartof | SIAM JOURNAL ON COMPUTING | en_US |
dc.subject | network reliability | en_US |
dc.subject | approximate counting | en_US |
dc.subject | randomized algorithms | en_US |
dc.title | A POLYNOMIAL-TIME APPROXIMATION ALGORITHM FOR ALL-TERMINAL NETWORK RELIABILITY | en_US |
dc.type | Article | |
dc.rights.holder | © 2019, Society for Industrial and Applied Mathematics Read More: https://epubs.siam.org/doi/10.1137/18M1201846 | |
dc.identifier.doi | 10.1137/18M1201846 | en_US |
pubs.author-url | http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000473071600004&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=612ae0d773dcbdba3046f6df545e9f6a | en_US |
pubs.issue | 3 | en_US |
pubs.notes | Not known | en_US |
pubs.publication-status | Published | en_US |
pubs.volume | 48 | en_US |
rioxxterms.funder | Default funder | en_US |
rioxxterms.identifier.project | Default project | en_US |