Dual of a complete graph as an interconnection network

DOI10.1006/JPDC.2000.1640zbMATH Open0962.68140OpenAlexW2149466643MaRDI QIDQ1581285FDOQ1581285

Authors: R. Smith 

Publication date: 13 June 2001

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/c2f9acff54be215a17d36fd6166c2fd9d3fe0212

Recommendations

• scientific article; zbMATH DE number 1270450
• scientific article; zbMATH DE number 568784
• scientific article; zbMATH DE number 140108
• Efficient collective communications in dual-cube
• Bus interconnection networks

zbMATH Keywords

interconnection networkhypernetworks

Mathematics Subject Classification ID

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

Cited In (2)

• The connected component of the partial duplication graph
• A comparative study of doubly connected directed topologies for LANs and MANs

Uses Software

• RCC-FULL

This page was built for publication: Dual of a complete graph as an interconnection network

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