Embedding algorithm between MRH(n) and hypercube

DOI10.1007/978-3-642-10549-4_24MaRDI QIDQ3061103zbMATH OpenOpenAlexFDO

Authors Hyun Sim, Jaechul Oh, Hyeong-Ok Lee

Publication date 14 December 2010

Published in Communications in Computer and Information Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-10549-4_24

zbMATH Keywords

dilationembeddingexpansioninterconnection network

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05)

Recommendations

• Multiple reduced hypercube MRH(n): A new interconnection network reducing both diameter and edge of hypercube
• Multiple network embeddings into hypercubes
• scientific article; zbMATH DE number 140144
• Embedding of special classes of circulant networks, hypercubes and generalized Petersen graphs
• Hypercube emulation of interconnection networks topologies

Cited in

(1)

• Multiple reduced hypercube MRH(n): A new interconnection network reducing both diameter and edge of hypercube

This page was built for publication: Embedding algorithm between \(MRH(n)\) and hypercube

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