{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T16:32:29Z","timestamp":1775838749986,"version":"3.50.1"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1990,12,1]],"date-time":"1990-12-01T00:00:00Z","timestamp":660009600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Systems Theory"],"published-print":{"date-parts":[[1990,12]]},"DOI":"10.1007\/bf02090766","type":"journal-article","created":{"date-parts":[[2005,8,15]],"date-time":"2005-08-15T07:01:07Z","timestamp":1124089267000},"page":"61-77","source":"Crossref","is-referenced-by-count":31,"title":["Optimal embeddings of butterfly-like graphs in the hypercube"],"prefix":"10.1007","volume":"23","author":[{"given":"David S.","family":"Greenberg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lenwood S.","family":"Heath","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arnold L.","family":"Rosenberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02090766_CR1","volume-title":"The Design and Analysis of Computer Algorithms","author":"A. V. Aho","year":"1974","unstructured":"A. V. Aho, J. E. Hopcroft, and J. D. Ullman (1974):The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, MA."},{"key":"BF02090766_CR2","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1016\/0743-7315(87)90018-9","volume":"4","author":"F. Berman","year":"1987","unstructured":"F. Berman and L. Snyder (1987): On mapping parallel algorithms into parallel architectures.J. Parallel Distrib. Comput.,4, 439\u2013458.","journal-title":"J. Parallel Distrib. Comput."},{"key":"BF02090766_CR3","doi-asserted-by":"crossref","unstructured":"S. N. Bhatt and J.-Y. Cai (1988): Take a walk, grow a tree.Proc. 29th IEEE Symp. on Foundations of Computer Science, pp. 469\u2013478.","DOI":"10.1109\/SFCS.1988.21963"},{"key":"BF02090766_CR4","doi-asserted-by":"crossref","unstructured":"S. N. Bhatt, F. R. K. Chung, J.-W. Hong, F. T. Leighton, and A. L. Rosenberg (1988): Optimal simulations by Butterfly networks. Tech. Rpt. 88-55, University of Massachusetts; submitted for publication. See also,Proc. 20th ACM Symp. on Theory of Computing, pp. 192\u2013204.","DOI":"10.21236\/ADA200780"},{"key":"BF02090766_CR5","unstructured":"S. N. Bhatt, F. R. K. Chung, F. T. Leighton, and A. L. Rosenberg (1988): Efficient embeddings of trees in hypercubes. Tech. Rpt. 88\u201394, University of Massachusetts; submitted for publication. See also, (1986): Optimal simulations of tree machines.Proc. 27th IEEE Symp. on Foundations of Computer Science pp. 274\u2013282."},{"key":"BF02090766_CR6","unstructured":"S. N. Bhatt and I. Ipsen (1985): Embedding trees in the hypercube. Tech. Rpt. DCS\/RR-443, Yale University."},{"key":"BF02090766_CR7","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1109\/TC.1981.1675756","volume":"30","author":"S. H. Bokhari","year":"1981","unstructured":"S. H. Bokhari (1981): On the mapping problem.IEEE Trnas. Comput.,30, 207\u2013214.","journal-title":"IEEE Trnas. Comput."},{"key":"BF02090766_CR8","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0167-8191(88)90087-7","volume":"6","author":"R. M. Chamberlain","year":"1988","unstructured":"R. M. Chamberlain (1988): Gray codes, Fast Fourier Transforms and hypercubes.Parallel Comput.,6, 225\u2013233.","journal-title":"Parallel Comput."},{"key":"BF02090766_CR9","doi-asserted-by":"crossref","first-page":"1285","DOI":"10.1109\/12.5991","volume":"37","author":"M. Y. Chan","year":"1988","unstructured":"M. Y. Chan and F. Y. L. Chin (1988): On embedding rectangular grids in hypercubes.IEEE Trans. Comput.,37, 1285\u20131288.","journal-title":"IEEE Trans. Comput."},{"key":"BF02090766_CR10","unstructured":"T. F. Chan (1986): On Gray code mapping for mesh-FFTs on binaryN-cubes. Tech. Rpt. RIACS-86.17, NASA Ames Research Center."},{"key":"BF02090766_CR11","unstructured":"T. C. Chen, M. D. F. Schlag, and C. K. Wong (1983): The hypercube connection network. IBM Report RC-10219."},{"key":"BF02090766_CR12","unstructured":"D. S. Greenberg, L. S. Heath, and A. L. Rosenberg (1988): Optimal embeddings of FFT graphs in the Hypercube. Tech. Rpt. 88-23, University of Massachusetts."},{"key":"BF02090766_CR13","doi-asserted-by":"crossref","first-page":"709","DOI":"10.1145\/2157.322401","volume":"30","author":"J.-W. Hong","year":"1983","unstructured":"J.-W. Hong, K. Mehlhorn, and A. L. Rosenberg (1983): Cost tradeoffs in graph embeddings.J. Assoc. Comput. Mach.,30, 709\u2013728.","journal-title":"J. Assoc. Comput. Mach."},{"key":"BF02090766_CR14","unstructured":"L. Johnsson (1985): Basic linear algebra computations on hypercube architectures. Tech. Rpt., Yale University."},{"key":"BF02090766_CR15","doi-asserted-by":"crossref","unstructured":"F. T. Leighton, M. Newman, E. Schwabe, and A. G. Ranade (1989): Dynamic tree embeddings in Butterflies and Hypercubes.Proc. 1st ACM Symp. on Parallel Algorithms and Architectures.","DOI":"10.1145\/72935.72959"},{"key":"BF02090766_CR16","unstructured":"B. Monien (1989): Private communication."},{"key":"BF02090766_CR17","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1145\/358645.358660","volume":"24","author":"F. P. Preparata","year":"1981","unstructured":"F. P. Preparata and J. E. Vuillemin (1981): The cube-connected cycles: a versatile network for parallel computation.Comm. ACM,24, 300\u2013309.","journal-title":"Comm. ACM"},{"key":"BF02090766_CR18","volume-title":"Combinatorial Algorithms: Theory and Practice","author":"E. M. Reingold","year":"1977","unstructured":"E. M. Reingold, J. Nievergelt, and N. Deo (1977):Combinatorial Algorithms: Theory and Practice. Prentice-Hall, Englewood Cliffs, NJ."},{"key":"BF02090766_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1007\/3-540-10291-4_12","volume-title":"Graph-Theoretic Concepts in Computer Science: Proceedings of the International Workshop WG80","author":"A. L. Rosenberg","year":"1981","unstructured":"A. L. Rosenberg (1981): Issues in the study of graph embeddings. InGraph-Theoretic Concepts in Computer Science: Proceedings of the International Workshop WG80, Bad Honnef (H. Noltemeier, ed.) Lecture Notes in Computer Science, Vol. 100, Springer-Verlag, Berlin, pp. 150\u2013176."},{"key":"BF02090766_CR20","doi-asserted-by":"crossref","first-page":"867","DOI":"10.1109\/12.2234","volume":"37","author":"Y. Saad","year":"1988","unstructured":"Y. Saad and M. H. Schultz (1988): Topological properties of hypercubes.IEEE Trans. Comput.,37, 867\u2013872.","journal-title":"IEEE Trans. Comput."}],"container-title":["Mathematical Systems Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02090766.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02090766\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02090766","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T14:05:50Z","timestamp":1557842750000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02090766"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,12]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1990,12]]}},"alternative-id":["BF02090766"],"URL":"https:\/\/doi.org\/10.1007\/bf02090766","relation":{},"ISSN":["0025-5661","1433-0490"],"issn-type":[{"value":"0025-5661","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[1990,12]]}}}