Fully symmetric swapped networks based on bipartite cluster connectivity

DOI10.1016/J.IPL.2009.12.006zbMATH Open1209.68028OpenAlexW2052718901MaRDI QIDQ991756

Behrooz Parhami, Wenjun Xiao, Wenhong Wei, Weidong Chen, Ming-Xin He

Publication date: 7 September 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2009.12.006

zbMATH Keywords

bipartite graphtopological parametersrouting algorithminterconnection networkhierarchical networkOTIS networkswapped network

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Swapped interconnection networks: Topological, performance, and robustness attributes
• Group Action Graphs and Parallel Architectures
• A group-theoretic model for symmetric interconnection networks
• Some mathematical properties of cayley digraphs with applications to interconnection network design

Related Items (4)

Biswapped networks: a family of interconnection architectures with advantages over swapped or OTIS networks ⋮ Multiswapped networks and their topological and algorithmic properties ⋮ Using semidirect products of groups to build classes of interconnection networks ⋮ Swapped interconnection networks: Topological, performance, and robustness attributes

This page was built for publication: Fully symmetric swapped networks based on bipartite cluster connectivity