{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T10:45:28Z","timestamp":1648637128084},"reference-count":5,"publisher":"Elsevier BV","issue":"4","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":["Information Processing Letters"],"published-print":{"date-parts":[[1994,8]]},"DOI":"10.1016\/0020-0190(94)00076-x","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:37:30Z","timestamp":1027640250000},"page":"195-199","source":"Crossref","is-referenced-by-count":0,"title":["On the equivalence in complexity among three computation problems on maximum number of edge-disjoint s\u2212t paths in a probabilistic graph"],"prefix":"10.1016","volume":"51","author":[{"given":"Pen","family":"Cheng","sequence":"first","affiliation":[]},{"given":"Shigeru","family":"Masuyama","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(94)00076-X_BIB1","series-title":"The Combinatorics of Network Reliability","author":"Colbourn","year":"1987"},{"key":"10.1016\/0020-0190(94)00076-X_BIB2","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0020-0190(94)00076-X_BIB3","series-title":"Graph Theory","author":"Harary","year":"1969"},{"key":"10.1016\/0020-0190(94)00076-X_BIB4","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\/0020-0190(94)00076-X_BIB5","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":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909400076X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909400076X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T04:51:30Z","timestamp":1555131090000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909400076X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,8]]},"references-count":5,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1994,8]]}},"alternative-id":["002001909400076X"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(94)00076-x","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1994,8]]}}}