Optimal embeddings of butterfly-like graphs in the hypercube
- 1 December 1990
- journal article
- research article
- Published by Springer Nature in Theory of Computing Systems
- Vol. 23 (1), 61-77
- https://doi.org/10.1007/bf02090766
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Dynamic tree embeddings in butterflies and hypercubesPublished by Association for Computing Machinery (ACM) ,1989
- Optimal Simulations by Butterfly NetworksPublished by Defense Technical Information Center (DTIC) ,1988
- Gray codes, Fast Fourier Transforms and hypercubesParallel Computing, 1988
- On embedding rectangular grids in hypercubesIEEE Transactions on Computers, 1988
- Take a walk, grow a treePublished by Institute of Electrical and Electronics Engineers (IEEE) ,1988
- On mapping parallel algorithms into parallel architecturesJournal of Parallel and Distributed Computing, 1987
- Cost Trade-offs in Graph Embeddings, with ApplicationsJournal of the ACM, 1983
- The cube-connected cycles: a versatile network for parallel computationCommunications of the ACM, 1981
- On the Mapping ProblemIEEE Transactions on Computers, 1981
- Issues in the study of graph embeddingsLecture Notes in Computer Science, 1981