{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T12:04:46Z","timestamp":1767182686793},"reference-count":15,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1993,7,1]],"date-time":"1993-07-01T00:00:00Z","timestamp":741484800000},"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":7321,"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":[[1993,7]]},"DOI":"10.1016\/0166-218x(93)90233-e","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:01Z","timestamp":1027654981000},"page":"221-232","source":"Crossref","is-referenced-by-count":22,"title":["Computing residual connectedness reliability for restricted networks"],"prefix":"10.1016","volume":"44","author":[{"given":"Charles J.","family":"Colbourn","sequence":"first","affiliation":[]},{"given":"A.","family":"Satyanarayana","sequence":"additional","affiliation":[]},{"given":"C.","family":"Suffel","sequence":"additional","affiliation":[]},{"given":"K.","family":"Sutner","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(93)90233-E_BIB1","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1109\/24.46478","article-title":"Computing 2-terminal reliability for radio broadcast networks","volume":"38","author":"AboElFotoh","year":"1989","journal-title":"IEEE Trans. Reliability"},{"key":"10.1016\/0166-218X(93)90233-E_BIB2","unstructured":"H.M.F. AboElFotoh and C.J. Colbourn, Efficient algorithms for computing the reliability of permutation and interval graphs, Networks, to appear."},{"key":"10.1016\/0166-218X(93)90233-E_BIB3","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0166-218X(89)90031-0","article-title":"Linear time algorithms for NP-hard problems restricted to k-trees","volume":"23","author":"Arnborg","year":"1989","journal-title":"Discrete Appl. Math."},{"year":"1987","series-title":"The Combinatorics of Network Reliability","author":"Colbourn","key":"10.1016\/0166-218X(93)90233-E_BIB4"},{"key":"10.1016\/0166-218X(93)90233-E_BIB5","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/0167-6377(85)90044-6","article-title":"Finding minimum dominating cycles in permutation graphs","volume":"4","author":"Colbourn","year":"1985","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/0166-218X(93)90233-E_BIB6","doi-asserted-by":"crossref","unstructured":"C.J. Colbourn and L.K. Stewart, Permutation graphs: connected dominating and Steiner trees, in: Annals of Discrete Mathematics (North-Holland, Amsterdam, to appear).","DOI":"10.1016\/S0167-5060(08)71048-3"},{"key":"10.1016\/0166-218X(93)90233-E_BIB7","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0166-218X(81)90013-5","article-title":"Complement reducible graphs","volume":"3","author":"Corneil","year":"1981","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0166-218X(93)90233-E_BIB8","doi-asserted-by":"crossref","first-page":"926","DOI":"10.1137\/0214065","article-title":"A linear recognition algorithm for cographs","volume":"14","author":"Corneil","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(93)90233-E_BIB9","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0196-6774(85)90001-X","article-title":"Dominating sets in permutation graphs","volume":"6","author":"Farber","year":"1985","journal-title":"J. Algorithms"},{"key":"10.1016\/0166-218X(93)90233-E_BIB10","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0012-365X(75)90021-7","article-title":"A recognition algorithm for the intersection graphs of directed paths in directed trees","volume":"13","author":"Gavril","year":"1975","journal-title":"Discrete Math."},{"key":"10.1016\/0166-218X(93)90233-E_BIB11","doi-asserted-by":"crossref","first-page":"694","DOI":"10.1137\/0215050","article-title":"The complexity of reliability computations on planar and acyclic graphs","volume":"15","author":"Provan","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(93)90233-E_BIB12","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1145\/800061.808777","article-title":"Transitive orientation in O(n2) time","author":"Spinrad","year":"1983","journal-title":"Proceedings Fifteenth ACM Symposium on the Theory of Computing"},{"key":"10.1016\/0166-218X(93)90233-E_BIB13","doi-asserted-by":"crossref","unstructured":"K. Sutner, A. Satyanaranaya and C. Suffel, The complexity of the residual node connectedness reliability problem, SIAM J. Comput., to appear.","DOI":"10.1137\/0220009"},{"key":"10.1016\/0166-218X(93)90233-E_BIB14","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":"1997","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(93)90233-E_BIB15","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1002\/net.3230130202","article-title":"Steiner trees, partial 2-trees and minimum IFI networks","volume":"13","author":"Wald","year":"1983","journal-title":"Networks"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9390233E?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9390233E?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T06:25:26Z","timestamp":1555136726000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9390233E"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,7]]},"references-count":15,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1993,7]]}},"alternative-id":["0166218X9390233E"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(93)90233-e","relation":{},"ISSN":["0166-218X"],"issn-type":[{"type":"print","value":"0166-218X"}],"subject":[],"published":{"date-parts":[[1993,7]]}}}