{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T01:58:12Z","timestamp":1768010292297,"version":"3.49.0"},"reference-count":25,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1988,10,1]],"date-time":"1988-10-01T00:00:00Z","timestamp":591667200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":9055,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1988,10]]},"DOI":"10.1016\/0166-218x(88)90065-0","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:43:01Z","timestamp":1027640581000},"page":"185-198","source":"Crossref","is-referenced-by-count":73,"title":["Lower bounds on two-terminal network reliability"],"prefix":"10.1016","volume":"21","author":[{"given":"Timothy B.","family":"Brecht","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Charles J.","family":"Colbourn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(88)90065-0_BIB1","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1002\/net.3230160307","article-title":"First and second order bounds for terminal reliability","volume":"16","author":"Assous","year":"1986","journal-title":"Networks"},{"key":"10.1016\/0166-218X(88)90065-0_BIB2","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1002\/net.3230130210","article-title":"Calculating bounds on reachability and connectedness in stochastic networks","volume":"13","author":"Ball","year":"1983","journal-title":"Networks"},{"key":"10.1016\/0166-218X(88)90065-0_BIB3","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1080\/00401706.1961.10489927","article-title":"Multicomponent systems and structures and their reliability","volume":"3","author":"Birnbaum","year":"1961","journal-title":"Technometrics"},{"key":"10.1016\/0166-218X(88)90065-0_BIB4","series-title":"M.Math. Thesis","article-title":"Lower bounds for two-terminal network reliability","author":"Brecht","year":"1985"},{"key":"10.1016\/0166-218X(88)90065-0_BIB5","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1002\/net.3230100404","article-title":"A recursive algorithm for finding reliability measures related to the connection of nodes in a graph","volume":"10","author":"Buzacott","year":"1980","journal-title":"Networks"},{"key":"10.1016\/0166-218X(88)90065-0_BIB6","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1002\/net.3230140307","article-title":"Bounds on expected performance of networks with links subject to failure","volume":"14","author":"Carey","year":"1984","journal-title":"Networks"},{"key":"10.1016\/0166-218X(88)90065-0_BIB7","doi-asserted-by":"crossref","unstructured":"C.J. Colbourn and D.D. Harms, Bounding all-terminal reliability in computer networks, Networks (to appear).","DOI":"10.1002\/net.3230180102"},{"key":"10.1016\/0166-218X(88)90065-0_BIB8","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1080\/00401706.1963.10490075","article-title":"Coherent structures of non-identical components","volume":"5","author":"Esary","year":"1963","journal-title":"Technometrics"},{"key":"10.1016\/0166-218X(88)90065-0_BIB9","series-title":"Flows in Networks","author":"Ford","year":"1962"},{"key":"10.1016\/0166-218X(88)90065-0_BIB10","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1016\/0012-365X(84)90193-6","article-title":"A new short proof for the Krustal-Katona theorem","volume":"48","author":"Frankl","year":"1984","journal-title":"Discrete Math."},{"key":"10.1016\/0166-218X(88)90065-0_BIB11","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1002\/net.3230120306","article-title":"The complexity of finding maximum disjoint paths with length constraint","volume":"12","author":"Itai","year":"1982","journal-title":"Networks"},{"key":"10.1016\/0166-218X(88)90065-0_BIB12","series-title":"Theory of Graphs","first-page":"187","article-title":"A theorem on finite sets","author":"Katona","year":"1968"},{"key":"10.1016\/0166-218X(88)90065-0_BIB13","series-title":"Mathematical Optimization Techniques","first-page":"251","article-title":"The number of simplices in a complex","author":"Kruskal","year":"1963"},{"key":"10.1016\/0166-218X(88)90065-0_BIB14","series-title":"Combinatorial Optimization: Networks and Matroids","author":"Lawler","year":"1976"},{"key":"10.1016\/0166-218X(88)90065-0_BIB15","doi-asserted-by":"crossref","first-page":"96","DOI":"10.4064\/fm-10-1-96-115","article-title":"Zur allgemeine Kurventheorie","volume":"10","author":"Menger","year":"1927","journal-title":"Fund. Math."},{"key":"10.1016\/0166-218X(88)90065-0_BIB16_1","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0016-0032(56)90559-2","article-title":"Reliable circuits using less reliable relays","volume":"262","author":"Moore","year":"1956","journal-title":"J. Franklin Inst."},{"key":"10.1016\/0166-218X(88)90065-0_BIB16_2","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/0016-0032(56)90044-8","article-title":"Reliable circuits using less reliable relays","volume":"262","author":"Moore","year":"1956","journal-title":"J. Franklin Inst."},{"key":"10.1016\/0166-218X(88)90065-0_BIB17","first-page":"165","article-title":"A lower boundary for the reliability of information networks","volume":"7","author":"Polesskii","year":"1971","journal-title":"Problems Inform. Transmission"},{"key":"10.1016\/0166-218X(88)90065-0_BIB18","doi-asserted-by":"crossref","first-page":"777","DOI":"10.1137\/0212053","article-title":"The complexity of counting cuts and of computing the probability that a graph is connected","volume":"12","author":"Provan","year":"1983","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(88)90065-0_BIB19","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1137\/0132031","article-title":"Computing the reliability of complex networks","volume":"32","author":"Rosenthal","year":"1977","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/0166-218X(88)90065-0_BIB20","doi-asserted-by":"crossref","first-page":"1027","DOI":"10.1287\/opre.24.6.1027","article-title":"Sequential bounding of the reliability of a stochastic network","volume":"34","author":"Shogan","year":"1976","journal-title":"Oper. Res."},{"key":"10.1016\/0166-218X(88)90065-0_BIB21","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1137\/0208032","article-title":"The complexity of enumeration and reliability problems","volume":"8","author":"Valiant","year":"1979","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(88)90065-0_BIB22","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1002\/net.3230010307","article-title":"Network reliability analysis: Part I","volume":"1","author":"van Slyke","year":"1972","journal-title":"Networks"},{"key":"10.1016\/0166-218X(88)90065-0_BIB23","doi-asserted-by":"crossref","first-page":"837","DOI":"10.1016\/0026-2714(83)91008-9","article-title":"Steiner trees in probabilistic networks","volume":"23","author":"Wald","year":"1983","journal-title":"Microelectron. Reliab."},{"key":"10.1016\/0166-218X(88)90065-0_BIB24","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1002\/net.3230120408","article-title":"Polynomial algorithms for estimating network reliability","volume":"12","author":"Zemel","year":"1982","journal-title":"Networks"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X88900650?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X88900650?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T01:54:47Z","timestamp":1555120487000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X88900650"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,10]]},"references-count":25,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1988,10]]}},"alternative-id":["0166218X88900650"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(88)90065-0","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1988,10]]}}}