Hypercube emulation of interconnection networks topologies
From MaRDI portal
Publication:2831031
DOI10.1002/mma.3820zbMath1348.05057arXiv1507.02147OpenAlexW3103418455MaRDI QIDQ2831031
Husain Alhazmi, Shakir Ali, Mathieu Dutour Sikirić, Adel N. Alahmadi, Michel Marie Deza, Patrick Solé
Publication date: 1 November 2016
Published in: Mathematical Methods in the Applied Sciences (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1507.02147
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bounds for sorting by prefix reversal
- Determination of all regular maps of small genus
- Recognition of the \(\ell_ 1\)-graphs with complexity \(O(nm)\), or Football in a hypercube
- A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G
- Hypercube embedding of Wythoffians
- Hypermetric Spaces and the Hamming Cone
- Geometry of cuts and metrics
This page was built for publication: Hypercube emulation of interconnection networks topologies