Optimal embeddings of butterfly-like graphs in the hypercube

DOI10.1007/BF02090766zbMath0729.68072MaRDI QIDQ3355251

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

Publication date: 1990

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

zbMATH Keywords

hypercubeexpansionparallel computationdilationparallel processingcongestionembedding of a graph

Mathematics Subject Classification ID

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

Related Items (6)

An approach to emulating separable graphs ⋮ Cycles in butterfly graphs ⋮ Minimum spanners of butterfly graphs ⋮ Algebraic specification of interconnection network relationships by permutation voltage graph mappings ⋮ Product-shuffle networks: Toward reconciling shuffles and butterflies ⋮ Routing multiple paths in hypercubes

Cites Work

• Unnamed Item
• Unnamed Item
• Gray codes, fast Fourier transforms and hypercubes
• Solving narrow banded systems on ensemble architectures
• Cost Trade-offs in Graph Embeddings, with Applications
• On embedding rectangular grids in hypercubes

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