{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T19:29:58Z","timestamp":1787340598976,"version":"3.56.0"},"reference-count":17,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Comput."],"published-print":{"date-parts":[[1986,8]]},"abstract":"<jats:p>We show that the problem of computing source-sink reliability is NP-hard, in fact # P-complete, even for undirected and acyclic directed source-sink planar graphs having vertex degree at most three. Thus the source-sink reliability problem is unlikely to have an efficient algorithm, even when the graph can be laid out on a rectilinear grid.<\/jats:p>","DOI":"10.1137\/0215050","type":"journal-article","created":{"date-parts":[[2005,2,24]],"date-time":"2005-02-24T06:28:10Z","timestamp":1109226490000},"page":"694-702","source":"Crossref","is-referenced-by-count":74,"title":["The Complexity of Reliability Computations in Planar and Acyclic Graphs"],"prefix":"10.1137","volume":"15","author":[{"given":"J. Scott","family":"Provan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2006,7,31]]},"reference":[{"key":"R1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.32.3.493"},{"key":"R2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230100206"},{"key":"R3","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230130210"},{"key":"R4","volume-title":"Computers and intractability","author":"Garey Michael R.","year":"1979"},{"key":"R5","doi-asserted-by":"publisher","DOI":"10.1137\/0132071"},{"key":"R6","doi-asserted-by":"publisher","DOI":"10.1137\/0205049"},{"key":"R7","unstructured":"M. G. Luby,  Monte-carlo methods for estimating system reliability, Tech. Rep., 84\/168, Computer Science Division, Univ. California, Berkeley, CA,  1982, Chapter 6"},{"key":"R8","unstructured":"T. Politof, A. Satyanarayana,  A linear time algorithm to compute the reliability of planar cube free graphs, Tech. Rept., Dept. Electrical Engineering and Computer Science, Stevens Institute of Technology, Hoboken, NJ,  1985"},{"key":"R9","doi-asserted-by":"publisher","DOI":"10.1287\/moor.11.1.36"},{"key":"R10","doi-asserted-by":"publisher","DOI":"10.1137\/0212053"},{"key":"R11","doi-asserted-by":"publisher","DOI":"10.1137\/0132031"},{"key":"R12","doi-asserted-by":"publisher","DOI":"10.1109\/TR.1978.5220266"},{"key":"R13","first-page":"818","volume":"14","author":"Satyanarayana A.","year":"1985","journal-title":"this Journal"},{"key":"R14","doi-asserted-by":"publisher","DOI":"10.1287\/opre.24.6.1027"},{"key":"R15","unstructured":"J. Simon, Ph.D. Thesis,  On some central problems in computational complexity, Department of Computer Science, Cornell University, Ithaca, NY,  1975, (Tech. Rep. TR75-224)"},{"key":"R16","doi-asserted-by":"publisher","DOI":"10.1137\/0208032"},{"key":"R17","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230100107"}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/0215050","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:40:58Z","timestamp":1787337658000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/0215050"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,8]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1986,8]]}},"alternative-id":["10.1137\/0215050"],"URL":"https:\/\/doi.org\/10.1137\/0215050","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[1986,8]]}}}