{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T10:31:46Z","timestamp":1742380306646,"version":"3.30.1"},"reference-count":9,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2001,9,1]],"date-time":"2001-09-01T00:00:00Z","timestamp":999302400000},"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":4337,"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":[[2001,9]]},"DOI":"10.1016\/s0166-218x(00)00386-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T16:58:43Z","timestamp":1027616323000},"page":"43-58","source":"Crossref","is-referenced-by-count":3,"title":["Routing permutations and 2\u20131 routing requests in the hypercube"],"prefix":"10.1016","volume":"113","author":[{"given":"Olivier","family":"Baudon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guillaume","family":"Fertin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ivan","family":"Havel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(00)00386-3_BIB1","doi-asserted-by":"crossref","unstructured":"O. Baudon, G. Fertin, I. Havel, Routing permutations in the hypercube, Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science (WG\u201999), Ascona, 1999.","DOI":"10.1007\/3-540-46784-X_19"},{"key":"10.1016\/S0166-218X(00)00386-3_BIB2","doi-asserted-by":"crossref","unstructured":"R. Boppana, C.S. Raghavendra, Optimal self-routing of linear-complement permutations in hypercubes, DISTMEMCC: Fifth Distributed Memory Computing Conference, IEEE Computer Society Press, Silver Spring, MD, 1990, pp. 800\u2013808.","DOI":"10.1109\/DMCC.1990.556285"},{"key":"10.1016\/S0166-218X(00)00386-3_BIB3","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1006\/jpdc.1993.1097","article-title":"Rearrangeable circuit-switched hypercube architectures for routing permutations","volume":"19","author":"Choi","year":"1993","journal-title":"J. Parallel Distributed Comput."},{"key":"10.1016\/S0166-218X(00)00386-3_BIB4","unstructured":"A. Darmet, Private communication, 1992."},{"issue":"2","key":"10.1016\/S0166-218X(00)00386-3_BIB5","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1006\/jpdc.1997.1358","article-title":"Routing a permutation in the hypercube by two sets of edge disjoint paths","volume":"44","author":"Gu","year":"1997","journal-title":"J. Parallel Distributed Comput."},{"key":"10.1016\/S0166-218X(00)00386-3_BIB6","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0020-0190(90)90106-8","article-title":"Counterexample to a conjecture of Szymanski on hypercube routing","volume":"35","author":"Lubiw","year":"1990","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0166-218X(00)00386-3_BIB7","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/0166-218X(92)00126-7","article-title":"Routing for involutions of a hypercube","volume":"48","author":"Sprague","year":"1994","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(00)00386-3_BIB8","unstructured":"T. Szymanski, On the permutation capability of a circuit-switched hypercube, Proceedings of the International Conference on Parallel Processing, 1989, pp. I-103\u2013I-110."},{"key":"10.1016\/S0166-218X(00)00386-3_BIB9","doi-asserted-by":"crossref","unstructured":"K. Zemoudeh, A. Sengupta, Routing frequently used bijections on hypercube, DISTMEMCC: Fifth Distributed Memory Computing Conference, IEEE Computer Society Press, Silver Spring, MD, 1990, pp. 824\u2013832.","DOI":"10.1109\/DMCC.1990.556287"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X00003863?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X00003863?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,4]],"date-time":"2024-12-04T16:57:51Z","timestamp":1733331471000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X00003863"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,9]]},"references-count":9,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2001,9]]}},"alternative-id":["S0166218X00003863"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(00)00386-3","relation":{},"ISSN":["0166-218X"],"issn-type":[{"type":"print","value":"0166-218X"}],"subject":[],"published":{"date-parts":[[2001,9]]}}}