Hypercube emulation of interconnection networks topologies

DOI10.1002/MMA.3820zbMATH Open1348.05057arXiv1507.02147OpenAlexW3103418455MaRDI QIDQ2831031FDOQ2831031

Authors: Husain Alhazmi, Shakir Ali, Mathieu Dutour Sikirić, Adel Alahmadi, Michel Deza, Patrick Solé 

Publication date: 1 November 2016

Published in: Mathematical Methods in the Applied Sciences (Search for Journal in Brave)

Abstract: We address various topologies (de Bruijn, chordal ring, generalized Petersen, meshes) in various ways ( isometric embedding, embedding up to scale, embedding up to a distance) in a hypercube or a half-hypercube. Example of obtained embeddings: infinite series of hypercube embeddable Bubble Sort and Double Chordal Rings topologies, as well as of regular maps.

Full work available at URL: https://arxiv.org/abs/1507.02147

Recommendations

• Embedding star networks into hypercubes
• Efficient Embeddings into Hypercube-like Topologies
• Multiple network embeddings into hypercubes
• Embedding hypercubes and related networks into mesh-connected processor arrays
• Embedding cycles and meshes onto incomplete hypercubes

zbMATH Keywords

graphsdistancehypercubeembeddinginterconnection networks

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Planar graphs; geometric and topological aspects of graph theory (05C10) Hypergraphs (05C65)

Cites Work

• Title not available (Why is that?)
• A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G
• Determination of all regular maps of small genus
• Geometry of cuts and metrics
• Bounds for sorting by prefix reversal
• Hypercube embedding of Wythoffians
• Recognition of the \(\ell_ 1\)-graphs with complexity \(O(nm)\), or Football in a hypercube
• Hypermetric Spaces and the Hamming Cone
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (11)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Embedding graphs onto the Supercube
• Embedding of special classes of circulant networks, hypercubes and generalized Petersen graphs
• Optimal embeddings of the exchanged hypercube and the dual-cube as vertex-induced subgraphs of the hypercube
• Hypercube embeddings and Cayley graphs generated by transpositions
• Mapping rings and grids onto the FPS T-series hypercube
• Efficient Embeddings into Hypercube-like Topologies
• Embedding algorithm between \(MRH(n)\) and hypercube
• Embedding hypercubes and related networks into mesh-connected processor arrays
• Embedding hypercubes, rings, and odd graphs into hyper-stars

This page was built for publication: Hypercube emulation of interconnection networks topologies

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