{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,25]],"date-time":"2023-04-25T12:19:13Z","timestamp":1682425153172},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2012,11,8]],"date-time":"2012-11-08T00:00:00Z","timestamp":1352332800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2014,4]]},"DOI":"10.1007\/s00453-012-9703-x","type":"journal-article","created":{"date-parts":[[2012,11,7]],"date-time":"2012-11-07T14:31:17Z","timestamp":1352298677000},"page":"916-939","source":"Crossref","is-referenced-by-count":3,"title":["Fast Sequential Importance Sampling to Estimate the Graph Reliability Polynomial"],"prefix":"10.1007","volume":"68","author":[{"given":"David G.","family":"Harris","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francis","family":"Sullivan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Isabel","family":"Beichl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,11,8]]},"reference":[{"key":"9703_CR1","first-page":"143","volume":"197","author":"I. Beichl","year":"2010","unstructured":"Beichl, I., Cloteaux, B., Sullivan, F.: An approximation algorithm for the coefficients of the reliability polynomial. Congr. Numer. 197, 143\u2013151 (2010)","journal-title":"Congr. Numer."},{"key":"9703_CR2","doi-asserted-by":"crossref","unstructured":"Chechik, S., Emek, Y., Patt-Shamir, B., Peleg, D.: Sparse reliable graph Backbones. In: ICALP, pp. 261\u2013272 (2010)","DOI":"10.1007\/978-3-642-14162-1_22"},{"key":"9703_CR3","first-page":"217","volume-title":"Proceedings of the Seventeenth Manitoba Conference on Numerical Mathematics and Computing, Congressum Numerantium","author":"C. Colbourn","year":"1988","unstructured":"Colbourn, C., Debroni, B., Myrvold, W.: Estimating the coefficients of the reliability polynomial. In: Proceedings of the Seventeenth Manitoba Conference on Numerical Mathematics and Computing, Congressum Numerantium, vol. 62, pp. 217\u2013223 (1988)"},{"key":"9703_CR4","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1006\/jagm.1996.0014","volume":"20","author":"C. Colbourn","year":"1996","unstructured":"Colbourn, C., Myrvold, W., Neufeld, E.: Two algorithms for unranking arborescences. J. Algorithms 20, 268\u2013281 (1996)","journal-title":"J. Algorithms"},{"key":"9703_CR5","doi-asserted-by":"crossref","first-page":"581","DOI":"10.1287\/opre.34.4.581","volume":"34","author":"G. Fishman","year":"1986","unstructured":"Fishman, G.: A Monte Carlo sampling plan for estimating network reliability. Oper. Res. 34, 581\u2013594 (1986)","journal-title":"Oper. Res."},{"key":"9703_CR6","doi-asserted-by":"crossref","first-page":"1047","DOI":"10.1137\/0221062","volume":"21","author":"Z. Galil","year":"1992","unstructured":"Galil, Z., Italiano, G.: Fully dynamic algorithms for 2-edge connectivity. SIAM J. Comput. 21, 1047\u20131069 (1992)","journal-title":"SIAM J. Comput."},{"key":"9703_CR7","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/BF01398878","volume":"52","author":"W. Gautschi","year":"1988","unstructured":"Gautschi, W., Inglese, G.: Lower bounds for the condition number of Vandermonde matrices. Numer. Math. 52, 241\u2013250 (1988)","journal-title":"Numer. Math."},{"key":"9703_CR8","unstructured":"Henzinger, M., King, V.: Fully dynamic 2-edge connectivity algorithm in polylogarithmic time per operation. SRC Technical Note (1997)"},{"key":"9703_CR9","first-page":"11","volume":"29","author":"D. Karger","year":"1996","unstructured":"Karger, D.: A randomized fully polynomial time approximation scheme for the all terminal network reliability problem. SIAM J. Comput. 29, 11\u201317 (1996)","journal-title":"SIAM J. Comput."},{"key":"9703_CR10","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1002\/net.3230220704","volume":"22","author":"W. Myrvold","year":"1992","unstructured":"Myrvold, W.: Counting k-component forests of a graph. Networks 22, 647\u2013652 (1992)","journal-title":"Networks"},{"key":"9703_CR11","unstructured":"La Poutre, J.: Maintenance of 2- and 3- connected components of graphs, Part II: 2- and 3-edge-connected components and 2-vertex-connected components. Tech. Rep. RUU-CS-90-27, Utrecht University (1990)"},{"key":"9703_CR12","doi-asserted-by":"crossref","first-page":"777","DOI":"10.1137\/0212053","volume":"12","author":"J. Provan","year":"1983","unstructured":"Provan, J., Ball, M.: The complexity of counting cuts and the probability that a graph is connected. SIAM J. Comput. 12, 777\u2013788 (1983)","journal-title":"SIAM J. Comput."},{"key":"9703_CR13","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/BF02592076","volume":"39","author":"A. Ramanathan","year":"1987","unstructured":"Ramanathan, A., Colbourn, C.: Counting almost minimum cutsets with reliability applications. Math. Program. 39, 253\u2013261 (1987)","journal-title":"Math. Program."},{"key":"9703_CR14","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1145\/321879.321884","volume":"22","author":"R. Tarjan","year":"1975","unstructured":"Tarjan, R.: Efficiency of a good but not linear set union algorithm. J. ACM 22, 215\u2013225 (1975)","journal-title":"J. ACM"},{"key":"9703_CR15","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"D. Watts","year":"1998","unstructured":"Watts, D., Strogatz, S.: Collective dynamics of \u2018small-world\u2019 networks. Nature 393, 440\u2013442 (1998)","journal-title":"Nature"},{"key":"9703_CR16","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1145\/237814.237880","volume-title":"Proceedings of the Twenty-Eighth Annual ACM Symposium of Theory of Computing","author":"D. Wilson","year":"1996","unstructured":"Wilson, D.: Generating random spanning trees more quickly than the cover time. In: Proceedings of the Twenty-Eighth Annual ACM Symposium of Theory of Computing, pp. 296\u2013303 (1996)"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-012-9703-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-012-9703-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-012-9703-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,5]],"date-time":"2019-07-05T06:29:13Z","timestamp":1562308153000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-012-9703-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,11,8]]},"references-count":16,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2014,4]]}},"alternative-id":["9703"],"URL":"https:\/\/doi.org\/10.1007\/s00453-012-9703-x","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,11,8]]}}}