{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T00:21:12Z","timestamp":1773706872960,"version":"3.50.1"},"reference-count":15,"publisher":"Elsevier BV","issue":"1","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":["Information and Computation"],"published-print":{"date-parts":[[1988,10]]},"DOI":"10.1016\/0890-5401(88)90016-8","type":"journal-article","created":{"date-parts":[[2004,12,2]],"date-time":"2004-12-02T00:24:20Z","timestamp":1101947060000},"page":"43-59","source":"Crossref","is-referenced-by-count":193,"title":["The multi-tree approach to reliability in distributed networks"],"prefix":"10.1016","volume":"79","author":[{"given":"Alon","family":"Itai","sequence":"first","affiliation":[]},{"given":"Michael","family":"Rodeh","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0890-5401(88)90016-8_BIB1","series-title":"Combinatorial Algorithms","first-page":"91","article-title":"Edge disjoint branchings","author":"Edmonds","year":"1972"},{"key":"10.1016\/0890-5401(88)90016-8_BIB2","author":"Even","year":"1979"},{"key":"10.1016\/0890-5401(88)90016-8_BIB3","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1016\/0304-3975(76)90086-4","article-title":"Computing an s\u2212t numbering","volume":"2","author":"Even","year":"1976","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0890-5401(88)90016-8_BIB4","series-title":"Proceedings, ACM Sympos. on Principles of Database Systems","first-page":"1","article-title":"Impossibility of distributed consensus with one faulty process","author":"Fischer","year":"1983"},{"key":"10.1016\/0890-5401(88)90016-8_BIB5","series-title":"Proceedings, Fifth Colloquium on Automata, Languages and Programming","first-page":"289","article-title":"Covering a graph by circuits","author":"Itai","year":"1978"},{"key":"10.1016\/0890-5401(88)90016-8_BIB6","doi-asserted-by":"crossref","first-page":"746","DOI":"10.1137\/0210058","article-title":"Covering a graphy by simple circuits","volume":"10","author":"Itai","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0890-5401(88)90016-8_BIB15","unstructured":"Lempel, A. (1984), private communication."},{"key":"10.1016\/0890-5401(88)90016-8_BIB7","series-title":"\u201cTheory of Graphs,\u201d International Symposium","first-page":"215","article-title":"An algorithm for planarity testing of graphs","author":"Lempel","year":"1966-1967"},{"key":"10.1016\/0890-5401(88)90016-8_BIB8","doi-asserted-by":"crossref","first-page":"555","DOI":"10.4153\/CJM-1960-049-6","article-title":"On orientations, connectivity and odd vertex pairing in finite graphs","volume":"12","author":"Nash-Williams","year":"1960","journal-title":"Canad. J. Math."},{"key":"10.1016\/0890-5401(88)90016-8_BIB9","author":"Reif","year":"1983"},{"key":"10.1016\/0890-5401(88)90016-8_BIB10","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1016\/0020-0190(79)90086-3","article-title":"Edge disjoint branching in directed multigraphs","volume":"8","author":"Shiloach","year":"1979","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0890-5401(88)90016-8_BIB11","author":"Shrira","year":"1986"},{"key":"10.1016\/0890-5401(88)90016-8_BIB12","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0020-0190(74)90024-6","article-title":"A good algorithm for edge disjoint branchings","volume":"3","author":"Tarjan","year":"1975","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0890-5401(88)90016-8_BIB13","author":"Zehavi","year":"1986"},{"key":"10.1016\/0890-5401(88)90016-8_BIB14","article-title":"Three tree paths","author":"Zehavi","year":"1986","journal-title":"Journal Graph Theory"}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0890540188900168?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0890540188900168?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T18:27:59Z","timestamp":1549045679000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0890540188900168"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,10]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1988,10]]}},"alternative-id":["0890540188900168"],"URL":"https:\/\/doi.org\/10.1016\/0890-5401(88)90016-8","relation":{},"ISSN":["0890-5401"],"issn-type":[{"value":"0890-5401","type":"print"}],"subject":[],"published":{"date-parts":[[1988,10]]}}}