scientific article; zbMATH DE number 140144

MaRDI QIDQ4028529zbMATH OpenFDO

Authors Anand Kumar Winston, Ajay K. Gupta, Naveed A. Sherwani

Publication date 28 March 1993

zbMATH Keywords

algorithmsubgraphsbinary hypercubeembeddings for graphsnetwork architectures for parallel machines

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Applications of graph theory to circuits and networks (94C15)

Recommendations

• Embedding grids into hypercubes
• Multiple network embeddings into hypercubes
• Optimal embeddings of butterfly-like graphs in the hypercube
• A New Efficient Algorithm for Embedding an Arbitrary Binary Tree into Its Optimal Hypercube
• scientific article; zbMATH DE number 975387

Cited in

(7)

• On Relaxed Squashed Embedding of Graphs into a Hypercube
• Locality, Communication, and Interconnect Length in Multicomputers
• Embedding grids into hypercubes
• scientific article; zbMATH DE number 718860 (Why is no real title available?)
• Hypercube embedding heuristics: An evaluation
• Embedding algorithm between \(MRH(n)\) and hypercube
• Compressing cube-connected cycles and butterfly networks

This page was built for publication:

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