{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,30]],"date-time":"2022-12-30T21:12:53Z","timestamp":1672434773311},"reference-count":11,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2000,6,1]],"date-time":"2000-06-01T00:00:00Z","timestamp":959817600000},"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":4794,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2000,6]]},"DOI":"10.1016\/s0304-3975(99)00244-3","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T02:46:25Z","timestamp":1027651585000},"page":"487-494","source":"Crossref","is-referenced-by-count":2,"title":["A multi-tree routing scheme using acyclic orientations"],"prefix":"10.1016","volume":"240","author":[{"given":"Fred S.","family":"Annexstein","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kenneth A.","family":"Berman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tsan-Sheng","family":"Hsu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ram","family":"Swaminathan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(99)00244-3_BIB1","unstructured":"F.S. Annexstein, K.A. Berman, Directional routing via generalized st-numberings, University of Cincinnati Technical Report, 1999, submitted for journal publication."},{"issue":"1\u20133","key":"10.1016\/S0304-3975(99)00244-3_BIB2","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0166-218X(97)00100-5","article-title":"Reliable broadcasting in product networks","volume":"83","author":"Bao","year":"1998","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0304-3975(99)00244-3_BIB3","series-title":"Data Networks","author":"Bertsekas","year":"1992"},{"key":"10.1016\/S0304-3975(99)00244-3_BIB4","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1016\/0196-6774(88)90015-6","article-title":"Finding non-separating induced cycles and independent spanning trees in 3-connected graphs","volume":"9","author":"Cheriyan","year":"1988","journal-title":"J. Algorithms"},{"key":"10.1016\/S0304-3975(99)00244-3_BIB5","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1109\/90.502235","article-title":"The sink tree paradigm: connectionless traffic support on ATM LAN's","volume":"4","author":"Cohen","year":"1996","journal-title":"IEEE\/ACM Trans. on Networking"},{"key":"10.1016\/S0304-3975(99)00244-3_BIB6","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1109\/TCOM.1981.1094876","article-title":"Distributed algorithms for generating loop-free routes in networks with frequently changing topology","volume":"1","author":"Gafni","year":"1981","journal-title":"IEEE Trans. Commun. COM-29"},{"key":"10.1016\/S0304-3975(99)00244-3_BIB7","unstructured":"Garey, Johnson, Computers and Intractibilty, W.H. Freeman and Company, New York, 1977."},{"key":"10.1016\/S0304-3975(99)00244-3_BIB8","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1002\/jgt.3190200212","article-title":"Disproof of a conjecture about Independent branchings in k-connected directed graphs","volume":"20","author":"Huck","year":"1995","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0304-3975(99)00244-3_BIB9","unstructured":"A. Huck, Independent branchings in acyclic digraphs, 1996, submitted manuscript."},{"key":"10.1016\/S0304-3975(99)00244-3_BIB10","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/0890-5401(88)90016-8","article-title":"The multi-tree approach to reliability in distributed networks","volume":"79","author":"Itai","year":"1988","journal-title":"Inform. Comput."},{"key":"10.1016\/S0304-3975(99)00244-3_BIB11","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1002\/jgt.3190130205","article-title":"Three tree-paths","volume":"13","author":"Zehavi","year":"1989","journal-title":"J. Graph Theory"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599002443?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599002443?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,14]],"date-time":"2019-04-14T07:53:46Z","timestamp":1555228426000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397599002443"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,6]]},"references-count":11,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2000,6]]}},"alternative-id":["S0304397599002443"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(99)00244-3","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2000,6]]}}}