Interconnection Networks Based on a Generalization of Cube-Connected Cycles
From MaRDI portal
Recommendations
- Recursive cubes of rings as models for interconnection networks
- On the interconnected networks based on ringed crossed-cube Petersen
- scientific article; zbMATH DE number 436070
- The twisted-cube connected networks
- scientific article; zbMATH DE number 861408
- New methods for using Cayley graphs in interconnection networks
- The structure connectivity of enhanced hypercube networks
Cited in
(32)- Forwarding index of cube-connected cycles
- Interconnection networks for parallel molecular dynamics simulation based on Hamiltonian cubic symmetric topology
- Communication aspects of networks based on geometric incidence relations
- Large fault-tolerant interconnection networks
- New methods for using Cayley graphs in interconnection networks
- Application of coding theory to interconnection networks
- Processor interconnection networks from Cayley graphs
- Broadcasting on recursively decomposable Cayley graphs
- Some topological properties of star connected cycles
- Sparse networks tolerating random faults.
- RVCCC: a new variational network of cube-connected cycles and its topological properties
- The Josephus cube: A novel interconnection network
- Using semidirect products of groups to build classes of interconnection networks
- A new family of interconnection networks of odd fixed degrees
- The family of generalized variational network of cube-connected cycles
- The cube-of-rings interconnection network
- Layout of the cube-connected cycles without long wires
- scientific article; zbMATH DE number 5619279 (Why is no real title available?)
- A Classification of Cube-Connected Networks with a Simple Control Scheme
- A unified framework for off-line permutation routing in parallel networks
- scientific article; zbMATH DE number 1262802 (Why is no real title available?)
- The extended cube connected cycles: an efficient interconnection for massively parallel systems
- scientific article; zbMATH DE number 2080259 (Why is no real title available?)
- Degree- and time-constrained broadcast networks
- Exposing graph uniformities via algebraic specification
- Node bisectors of Cayley graphs
- scientific article; zbMATH DE number 861429 (Why is no real title available?)
- Fault-tolerant Hamiltonian laceability of balanced hypercubes
- On the diameter and bisector size of Cayley graphs
- Graph constructions derived from interconnection networks
- Constructing the vertex-transitive graphs of order 24
- Displacement operator based decompositions of matrices using circulants or other group matrices
This page was built for publication: Interconnection Networks Based on a Generalization of Cube-Connected Cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3690758)