Multiple network embeddings into hypercubes

DOI10.1006/JPDC.1993.1092MaRDI QIDQ1309213zbMATH OpenOpenAlexFDO

Authors Ajay K. Gupta, Susanne E. Hambrusch

Publication date 20 December 1993

Published in Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL https://docs.lib.purdue.edu/cstech/746

zbMATH Keywords

hypercubeembeddingparallel processing

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Mathematical problems of computer architecture (68M07)

Recommendations

• Incomplete hypercubes: Embeddings of tree-related networks
• Embedding star networks into hypercubes
• Embedding grids into hypercubes
• Routing multiple paths in hypercubes
• scientific article; zbMATH DE number 1769334

Cited in

(12)

• One-to-one embedding between hyper Petersen and Petersen-torus networks
• Embedding algorithm between \(MRH(n)\) and hypercube
• Embedding star networks into hypercubes
• scientific article; zbMATH DE number 842025 (Why is no real title available?)
• Hypercube emulation of interconnection networks topologies
• Multiple regular graph embeddings into a hypercube with unbounded expansion
• Incomplete hypercubes: Embeddings of tree-related networks
• scientific article; zbMATH DE number 140144 (Why is no real title available?)
• scientific article; zbMATH DE number 7366428 (Why is no real title available?)
• Embedding of special classes of circulant networks, hypercubes and generalized Petersen graphs
• On Relaxed Squashed Embedding of Graphs into a Hypercube
• Network Comparison: Embeddings and Interiors

This page was built for publication: Multiple network embeddings into hypercubes

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