Optimal embeddings of butterfly-like graphs in the hypercube

DOI10.1007/BF02090766MaRDI QIDQ3355251zbMATH OpenFDO

Authors David S. Greenberg, Lenwood S. Heath, Arnold L. Rosenberg

Publication date 1990

Published in Mathematical Systems Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF02090766

zbMATH Keywords

congestiondilationembedding of a graphexpansionhypercubeparallel computationparallel processing

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 70115
• Optimal emulations by butterfly-like networks
• Embedding grids into hypercubes
• scientific article; zbMATH DE number 140144
• Efficient Embeddings into Hypercube-like Topologies

Cites work

• Cost Trade-offs in Graph Embeddings, with Applications
• Gray codes, fast Fourier transforms and hypercubes
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• scientific article; zbMATH DE number 3573250 (Why is no real title available?)
• On embedding rectangular grids in hypercubes
• Solving narrow banded systems on ensemble architectures

Cited in

(23)

• Optimal book embeddings of the FFT, Benes, and barrel shifter networks
• Product-shuffle networks: Toward reconciling shuffles and butterflies
• Multiple graph embeddings into a processor array with spanning buses
• An optimal embedding of cycles into incomplete hypercubes
• Minimum spanners of butterfly graphs
• The congestion of generalized cube communication pattern in linear array network
• Routing multiple paths in hypercubes
• scientific article; zbMATH DE number 3917694 (Why is no real title available?)
• scientific article; zbMATH DE number 19194 (Why is no real title available?)
• scientific article; zbMATH DE number 70115 (Why is no real title available?)
• scientific article; zbMATH DE number 140144 (Why is no real title available?)
• An approach to emulating separable graphs
• Regular layouts of butterfly networks
• Optimal emulations by butterfly-like networks
• Compressing cube-connected cycles and butterfly networks
• Efficient Embeddings into Hypercube-like Topologies
• Algebraic specification of interconnection network relationships by permutation voltage graph mappings
• Embedding of special classes of circulant networks, hypercubes and generalized Petersen graphs
• Cycles in butterfly graphs
• A tight bound for congestion of an embedding
• Mapping Cycles and Trees on Wrap-Around Butterfly Graphs
• Optimal embeddings of the exchanged hypercube and the dual-cube as vertex-induced subgraphs of the hypercube
• Embeddings on a Boolean cube

This page was built for publication: Optimal embeddings of butterfly-like graphs in the hypercube

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3355251)