{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T00:01:45Z","timestamp":1767139305255,"version":"build-2238731810"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662232064","type":"print"},{"value":"9783662252093","type":"electronic"}],"license":[{"start":{"date-parts":[[1991,1,1]],"date-time":"1991-01-01T00:00:00Z","timestamp":662688000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/978-3-662-25209-3_13","type":"book-chapter","created":{"date-parts":[[2013,8,21]],"date-time":"2013-08-21T05:33:51Z","timestamp":1377063231000},"page":"179-190","source":"Crossref","is-referenced-by-count":0,"title":["Embeddings of shuffle-like graphs in hypercubes"],"prefix":"10.1007","author":[{"given":"M.","family":"Baumslag","sequence":"first","affiliation":[]},{"given":"M. C.","family":"Heydemann","sequence":"additional","affiliation":[]},{"given":"J.","family":"Opatrny","sequence":"additional","affiliation":[]},{"given":"D.","family":"Sotteau","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","unstructured":"J.-C. Bermond and C. Peyrat. de Bruijn and Kautz networks: a competitor for the hypercube? Proceedings of the 1st European Workshop on Hypercubes and Distributed Computers, Rennes, North Holland, F.Andre aced J.P. Verjus ed.,pages 279\u2013293, 1989."},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"S. Bhatt, F. Chung, T. Leighton, and A. Rosenberg. Optimal simulations of tree machines. IEEE, pages 274\u2013282, 1986.","DOI":"10.1109\/SFCS.1986.38"},{"key":"13_CR3","volume-title":"Preprint","author":"M Bouabdallah","year":"1990","unstructured":"M. Bouabdallah and J.-C. Konig. Embedding de Bruijn networks in the hypercube. Preprint, 1990."},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"M. Chan. Embedding of d-dimensional grids into optimal hypercubes. 1st ACM Symposium on Parallel Algorithms and Architectures, pages 52\u201357, 1989.","DOI":"10.1145\/72935.72941"},{"key":"13_CR5","volume-title":"Preprint","author":"O Collins","year":"1989","unstructured":"O. Collins, S. Dolinar, R. McEliece, and F. Pollara. A VLSI decomposition of the de Bruijn graph. Preprint, 1989."},{"key":"13_CR6","first-page":"758","volume":"49","author":"N de Bruijn","year":"1946","unstructured":"N. de Bruijn. A combinatorical problem. Koninklijke Nederlandsche Akademie van Wetenschappen Proc., A 49: 758\u2013764, 1946.","journal-title":"A"},{"key":"13_CR7","volume-title":"The cube connected cycle network is a subgraph of the butterfly network","author":"R Feldmann","year":"1991","unstructured":"R. Feldmann and W. Unger. The cube connected cycle network is a subgraph of the butterfly network. Technical report, University of Paderborn, 1991."},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"D. Greenberg and S. Bhatt. Routing multiple paths in hypercubes. Proceedings of SPAA, pages 45\u201354, 1990.","DOI":"10.1145\/97444.97457"},{"key":"13_CR9","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/BF02090766","volume":"23","author":"DS Greenberg","year":"1990","unstructured":"D. S. Greenberg, L. S. Heath, and A. Rosenberg. Optimal embeddings of butterfly-like graphs in the hypercube. Mathematical Systems Theory, 23: 61\u201377, 1990.","journal-title":"Mathematical Systems Theory"},{"key":"13_CR10","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/0743-7315(90)90131-8","volume":"8","author":"CT Ho","year":"1990","unstructured":"C.-T. Ho and S. L. Johnson. Embedding meshes in boolean cubes by graph decomposition. Journal of Parallel and Distributed Computing, 8: 325\u2013339, 1990.","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"13_CR11","unstructured":"R. Koch, T. Leighton, B. Maggs, S. Rao, and A. Rosenberg. Work-preserving emulations of fixed-connection networks. Preprint."},{"key":"13_CR12","volume-title":"Preprint","author":"B Monien","year":"1988","unstructured":"B. Monien and H. Sudborough. Comparing interconnection networks. Preprint, 1988."},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"E. J. Schwabe. On the computational equivalence of hypercube-derived networks. 2nd Symposium on Parallel Algorithms and Architectures, pages 388\u2013397, 1990.","DOI":"10.1145\/97444.97706"},{"key":"13_CR14","volume-title":"123:197-221","author":"PM Winkler","year":"1987","unstructured":"P. M. Winkler. The metric structure of graphs. Surveys in Combinatorics, (C. Whitehead, ed.), London Math. Soc. Lecture Notes Series, 123:197\u2013221, 1987."}],"container-title":["Lecture Notes in Computer Science","Parle \u201991 Parallel Architectures and Languages Europe"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-25209-3_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T14:59:29Z","timestamp":1558018769000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-25209-3_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783662232064","9783662252093"],"references-count":14,"aliases":["10.1007\/bfb0035104"],"URL":"https:\/\/doi.org\/10.1007\/978-3-662-25209-3_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991]]}}}