{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T20:03:33Z","timestamp":1648670613685},"reference-count":11,"publisher":"Elsevier BV","issue":"7","license":[{"start":{"date-parts":[[1994,8,1]],"date-time":"1994-08-01T00:00:00Z","timestamp":775699200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[1994,8]]},"DOI":"10.1016\/0305-0548(94)90006-x","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T12:15:45Z","timestamp":1056975345000},"page":"769-776","source":"Crossref","is-referenced-by-count":0,"title":["Parametric max flow problems in a class of networks with series-parallel structure"],"prefix":"10.1016","volume":"21","author":[{"given":"C.S.","family":"Sung","sequence":"first","affiliation":[]},{"given":"B.K.","family":"Yoo","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0305-0548(94)90006-X_BIB1","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1137\/0218003","article-title":"A fast parametric maximum flow algorithm and applications","volume":"18","author":"Gallo","year":"1989","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0305-0548(94)90006-X_BIB2","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\/0305-0548(94)90006-X_BIB3","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1109\/24.9868","article-title":"Simple enumeration of minimal cutsets of acyclic directed graph","volume":"R-37","author":"Ahmad","year":"1988","journal-title":"IEEE Trans. Reliability"},{"key":"10.1016\/0305-0548(94)90006-X_BIB4","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1109\/TR.1979.5220473","article-title":"Enumeration of all minimal cut-sets for a node pair in a graph","volume":"R-28","author":"Arunkumar","year":"1979","journal-title":"IEEE Trans. Reliability"},{"key":"10.1016\/0305-0548(94)90006-X_BIB5","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1109\/TR.1985.5221974","article-title":"A new technique in minimal path and cutset evaluation","volume":"R-34","author":"Jasmon","year":"1985","journal-title":"IEEE Trans. Reliability"},{"key":"10.1016\/0305-0548(94)90006-X_BIB6","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1109\/TR.1978.5220270","article-title":"Inverting and minimalizing path-sets and cut-sets","volume":"R-27","author":"Locks","year":"1978","journal-title":"IEEE Trans. Reliability"},{"key":"10.1016\/0305-0548(94)90006-X_BIB7","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1109\/TR.1970.5216391","article-title":"A computer program for approximating system reliability","volume":"R-19","author":"Nelson","year":"1970","journal-title":"IEEE Trans. Reliability"},{"key":"10.1016\/0305-0548(94)90006-X_BIB8","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1109\/TR.1977.5215069","article-title":"Computer program for approximating the reliability characteristics of acyclic directed graphs","volume":"R-26","author":"Pearson","year":"1977","journal-title":"IEEE Trans. Reliability"},{"key":"10.1016\/0305-0548(94)90006-X_BIB9","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1109\/TR.1985.5222173","article-title":"Algorithms for generating minimal cutsets by inversion","volume":"R-34","author":"Shier","year":"1985","journal-title":"IEEE Trans. Reliability"},{"key":"10.1016\/0305-0548(94)90006-X_BIB10","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1287\/opre.32.3.493","article-title":"An O(\u00a6E\u00a6) time algorithm for computing the reliability of a class of directed networks","volume":"32","author":"Agrawal","year":"1984","journal-title":"Ops. Res."},{"key":"10.1016\/0305-0548(94)90006-X_BIB11","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1002\/net.3230150209","article-title":"Network reliability analysis using 2-connected diagraph reductions","volume":"15","author":"Agrawal","year":"1985","journal-title":"Networks"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030505489490006X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030505489490006X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T13:27:25Z","timestamp":1552915645000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030505489490006X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,8]]},"references-count":11,"journal-issue":{"issue":"7","published-print":{"date-parts":[[1994,8]]}},"alternative-id":["030505489490006X"],"URL":"https:\/\/doi.org\/10.1016\/0305-0548(94)90006-x","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1994,8]]}}}