{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,9]],"date-time":"2026-10-09T12:57:05Z","timestamp":1791550625353,"version":"4.3.4"},"reference-count":17,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Comput."],"published-print":{"date-parts":[[1985,11]]},"abstract":"<jats:p>Let $G = (V,E)$ be a graph whose edges may fail with known probabilities and let $K \\subseteq V$ be specified. The K-terminal reliability of G, denoted $R(G_K )$, is the probability that all vertices in K are connected. Computing $R(G_K )$ is, in general, NP-hard. For some series-parallel graphs, $R(G_K )$ can be computed in polynomial time by repeated application of well-known reliability-preserving reductions. However, for other series-parallel graphs, depending on the configuration of K, $R(G_K )$ cannot be computed in this way. Only exponential-time algorithms as used on general graphs were known for computing $R(G_K )$ for these \u201cirreducible\u201d series-parallel graphs. We prove that $R(G_K )$ is computable in polynomial time in the irreducible case, too. A new set of reliability-preserving \u201cpolygon-to-chain\u201d reductions of general applicability is introduced which decreases the size of a graph, and conditions are given for a graph admitting such reductions. Combining all types of reductions, an $O(|E|)$ algorithm is presented for computing the reliability of any series-parallel graph irrespective of the vertices in K.<\/jats:p>","DOI":"10.1137\/0214057","type":"journal-article","created":{"date-parts":[[2005,2,24]],"date-time":"2005-02-24T06:25:35Z","timestamp":1109226335000},"page":"818-832","source":"Crossref","is-referenced-by-count":133,"title":["A Linear-Time Algorithm for Computing\n                    <i>K<\/i>\n                    -Terminal Reliability in Series-Parallel Networks"],"prefix":"10.1137","volume":"14","author":[{"given":"A.","family":"Satyanarayana","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"R. Kevin","family":"Wood","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2006,7,13]]},"reference":[{"key":"R1","volume-title":"Statistical theory of reliability and life testing","author":"Barlow Richard E.","year":"1975"},{"key":"R2","volume-title":"Graph theory with applications to engineering and computer science","author":"Deo Narsingh","year":"1974"},{"key":"R3","doi-asserted-by":"publisher","DOI":"10.1016\/0022-247X(65)90125-3"},{"key":"R4","doi-asserted-by":"publisher","DOI":"10.1109\/TCT.1973.1083657"},{"key":"R5","volume-title":"Computers and intractability","author":"Garey Michael R.","year":"1979"},{"key":"R6","unstructured":"J. N. Hagstrom, Ph.D. Thesis,  Combinatoric tools for computing network reliability, Dept. of IEOR, Univ. California, Berkeley,  1980"},{"key":"R7","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230040202"},{"key":"R8","doi-asserted-by":"publisher","DOI":"10.1109\/TR.1976.5214942"},{"key":"R9","doi-asserted-by":"publisher","DOI":"10.1109\/TR.1970.5216434"},{"key":"R10","first-page":"627","volume":"77","author":"Moskowitz F.","year":"1958","journal-title":"AIEE Trans. (Commun. Electron.)"},{"key":"R11","unstructured":"J. S. Provan, M. O. Ball,  The complexity of counting cuts and of computing the probability that a graph is connected, working Paper, MS\/S 81-002, College of Business and Management, Univ. Maryland, College Park,  1981"},{"key":"R12","unstructured":"A. Rosenthal, Ph.D. Thesis,  Computing reliability of complex systems, Dept. of EECS, Univ. California, Berkeley,  1974"},{"key":"R13","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230110402"},{"key":"R14","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230130107"},{"key":"R15","doi-asserted-by":"publisher","DOI":"10.1109\/TR.1976.5220034"},{"key":"R16","doi-asserted-by":"publisher","DOI":"10.1137\/0211023"},{"key":"R17","doi-asserted-by":"publisher","DOI":"10.1137\/0208032"}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/0214057","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:39:52Z","timestamp":1787337592000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/0214057"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,11]]},"references-count":17,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1985,11]]}},"alternative-id":["10.1137\/0214057"],"URL":"https:\/\/doi.org\/10.1137\/0214057","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[1985,11]]}}}