Supercube: An optimally fault tolerant network architecture
From MaRDI portal
Publication:1116687
DOI10.1007/BF00289159zbMath0666.68004OpenAlexW1994647606MaRDI QIDQ1116687
Publication date: 1989
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00289159
diameterconnectivityparallel processingfault-tolerancedistributed processingnetwork graphinterconnection network topology
Graph theory (including graph drawing) in computer science (68R10) Theory of operating systems (68N25) Theory of software (68N99)
Related Items (10)
Embedding cycles in IEH graphs ⋮ EMBEDDING HAMILTONIAN CYCLES, LINEAR ARRAYS AND RINGS IN A FAULTY SUPERCUBE ⋮ IEH graphs. A novel generalization of hypercube graphs ⋮ Supercube: An optimally fault tolerant network architecture ⋮ Incrementally extensible hypercube networks and their fault tolerance ⋮ Augmented \(k\)-ary \(n\)-cubes ⋮ On the routing problem in faulty supercubes ⋮ Routing properties of supercubes ⋮ Topological properties of supercube ⋮ Embedding cycles and meshes onto incomplete hypercubes
Cites Work
This page was built for publication: Supercube: An optimally fault tolerant network architecture