{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,6,18]],"date-time":"2022-06-18T08:07:26Z","timestamp":1655539646298},"reference-count":22,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1997,10,1]],"date-time":"1997-10-01T00:00:00Z","timestamp":875664000000},"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":5768,"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":[[1997,10]]},"DOI":"10.1016\/s0304-3975(97)00049-2","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:48:18Z","timestamp":1027644498000},"page":"347-377","source":"Crossref","is-referenced-by-count":8,"title":["Many-to-many routing on trees via matchings"],"prefix":"10.1016","volume":"185","author":[{"given":"Grammati E.","family":"Pantziou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alan","family":"Roberts","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antonis","family":"Symvonis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(97)00049-2_BIB1","series-title":"Parallel Sorting Algorithms","author":"Akl","year":"1985"},{"key":"10.1016\/S0304-3975(97)00049-2_BIB2","series-title":"Proc. 25th Annual ACM Symp. on Theory of Computing","first-page":"583","article-title":"Routing permutations on graphs via matchings","author":"Alon","year":"1993"},{"key":"10.1016\/S0304-3975(97)00049-2_BIB3","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1137\/S0895480192236628","article-title":"Routing permutations on graphs via matchings","volume":"7","author":"Alon","year":"1994","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0304-3975(97)00049-2_BIB4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TCOM.1964.1088883","article-title":"On distributed communication networks","volume":"CS-12","author":"Baran","year":"1964","journal-title":"IEEE Trans. on Comm. Systems"},{"key":"10.1016\/S0304-3975(97)00049-2_BIB5","series-title":"Proc. 12th Annual ACM Symp. on Principles of Distributed Computing (PODC 93)","first-page":"75","article-title":"Fast deflection routing for packets and worms","author":"Bar-Noy","year":"1993"},{"key":"10.1016\/S0304-3975(97)00049-2_BIB6","series-title":"2nd Annual ACM Symp. on Parallel Algorithms Architectures (SPAA 90)","first-page":"233","article-title":"A unified framework for off-line permutation routing in parallel networks","volume":"24","author":"Baumslag","year":"1991"},{"key":"10.1016\/S0304-3975(97)00049-2_BIB7","series-title":"Proc. 2nd European Symp. on Algorithms ESA '94","first-page":"365","article-title":"Greedy hot-potato Routing on the two-dimensional Mesh","volume":"vol. 855","author":"Ben-Aroya","year":"1994"},{"key":"10.1016\/S0304-3975(97)00049-2_BIB8","doi-asserted-by":"crossref","DOI":"10.1109\/71.595575","article-title":"Deterministic many-to-many hot potato routing","author":"Borodin","year":"1995"},{"key":"10.1016\/S0304-3975(97)00049-2_BIB9","series-title":"Proc. 29th Allerton Conf. on Comm. Control Comput.","first-page":"571","article-title":"Bounds on maximum delay in networks with deflection routing","author":"Brassil","year":"1991"},{"key":"10.1016\/S0304-3975(97)00049-2_BIB10","series-title":"Proc. 33rd Annual Symp. on Found. Comput. Sci.","first-page":"553","article-title":"Exact analysis of hot-potato routing","author":"Feige","year":"1992"},{"key":"10.1016\/S0304-3975(97)00049-2_BIB11","article-title":"Parallel neighbor-sort (or the glory of the induction principle)","author":"Haberman","year":"1972"},{"key":"10.1016\/S0304-3975(97)00049-2_BIB12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02311228","article-title":"Bounds on evacuation time for deflection routing","volume":"5","author":"Hajek","year":"1991","journal-title":"Distributed Comput."},{"key":"10.1016\/S0304-3975(97)00049-2_BIB13","series-title":"Proc. 5th Annual ACM Symp. on Parallel Algorithms Architectures, SPAA'93","first-page":"273","article-title":"Hot-potato routing on processor arrays","author":"Kaklamanis","year":"1993"},{"key":"10.1016\/S0304-3975(97)00049-2_BIB14","series-title":"Proc. 5th Internat. Symp. on Algorithms Computation ISAAC '94","first-page":"333","article-title":"Fast deterministic hot-potato routing on processor arrays","volume":"vol. 834","author":"Kaufmann","year":"1994"},{"key":"10.1016\/S0304-3975(97)00049-2_BIB15","series-title":"Packet routing via matchings","author":"Krizanc","year":"1996"},{"key":"10.1016\/S0304-3975(97)00049-2_BIB16","series-title":"Introduction to Parallel Algorithms and Architectures: Arrays \u2014 Trees \u2014 Hypercubes","author":"Leighton","year":"1991"},{"issue":"11","key":"10.1016\/S0304-3975(97)00049-2_BIB17","doi-asserted-by":"crossref","first-page":"1168","DOI":"10.1109\/71.476188","article-title":"Hot-potato algorithms for permutation routing","volume":"6","author":"Newman","year":"1995","journal-title":"IEEE Trans. Parallel Distri. Systems"},{"key":"10.1016\/S0304-3975(97)00049-2_BIB18","series-title":"Proc. 7th Internat. Symp. on Algorithms and Computation (ISAAC '96)","first-page":"275","article-title":"Dynamic tree routing under the \u201cmatching with consumption\u201d model","volume":"vol. 1178","author":"Pantziou","year":"1996"},{"key":"10.1016\/S0304-3975(97)00049-2_BIB19","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1002\/net.3230230420","article-title":"Routing permutations on a graph","volume":"23","author":"Ramras","year":"1993","journal-title":"Networks"},{"key":"10.1016\/S0304-3975(97)00049-2_BIB20_1","series-title":"Proc. 4th Workshop on Algorithms and Data Structures (WADS'95)","first-page":"251","article-title":"Routing on trees via matchings","volume":"vol. 955","author":"Roberts","year":"1995"},{"key":"10.1016\/S0304-3975(97)00049-2_BIB20_2","author":"Roberts","year":"1995"},{"key":"10.1016\/S0304-3975(97)00049-2_BIB21","unstructured":"L. Zhang, personal communication, 1996."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397597000492?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397597000492?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T12:59:16Z","timestamp":1555419556000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397597000492"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,10]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1997,10]]}},"alternative-id":["S0304397597000492"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(97)00049-2","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1997,10]]}}}