{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T16:37:07Z","timestamp":1649176627367},"reference-count":9,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1998,6,1]],"date-time":"1998-06-01T00:00:00Z","timestamp":896659200000},"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":5525,"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":[[1998,6]]},"DOI":"10.1016\/s0166-218x(98)00027-4","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T19:10:20Z","timestamp":1052766620000},"page":"25-45","source":"Crossref","is-referenced-by-count":2,"title":["Two-path subsets: Efficient counting and applications to performability analysis"],"prefix":"10.1016","volume":"85","author":[{"given":"Michael O.","family":"Ball","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jane N.","family":"Hagstrom","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.Scott","family":"Provan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(98)00027-4_BIB1","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1002\/net.3230250304","article-title":"Threshold reliability of networks with small failure sets","volume":"25","author":"Ball","year":"1995","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(98)00027-4_BIB2","article-title":"Two-path subsets: Efficient counting and applications to peformability analysis","author":"Ball","year":"1995"},{"key":"10.1016\/S0166-218X(98)00027-4_BIB3","series-title":"Combinatorial Optimization: Networks and Matroids","author":"Lawler","year":"1976"},{"key":"10.1016\/S0166-218X(98)00027-4_BIB4","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1287\/opre.37.4.531","article-title":"Methods for designing communications networks with certain two-connected survivability constraints","volume":"37","author":"Monma","year":"1989","journal-title":"Oper. Res."},{"key":"10.1016\/S0166-218X(98)00027-4_BIB5","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1002\/net.3230190303","article-title":"Exact cuts in networks","volume":"19","author":"Provan","year":"1989","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(98)00027-4_BIB6","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1090\/dimacs\/005\/14","article-title":"Boolean decomposition schemes and the complexity of reliability computations","volume":"5","author":"Provan","year":"1991","journal-title":"DIMACS Series in Discrete Mathematics and Theoret. Comput. Sci."},{"key":"10.1016\/S0166-218X(98)00027-4_BIB7","article-title":"The intractability of the 2-critical flow problem in k-flow graphs","author":"Provan","year":"1995"},{"key":"10.1016\/S0166-218X(98)00027-4_BIB8","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1109\/TCT.1969.1083004","article-title":"The design of minimum-cost survivable networks","volume":"CT-16","author":"Steiglitz","year":"1969","journal-title":"IEEE Trans Circuit Theory"},{"key":"10.1016\/S0166-218X(98)00027-4_BIB9","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."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X98000274?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X98000274?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,22]],"date-time":"2019-04-22T21:50:12Z","timestamp":1555969812000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X98000274"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,6]]},"references-count":9,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1998,6]]}},"alternative-id":["S0166218X98000274"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(98)00027-4","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1998,6]]}}}