Dual of a complete graph as an interconnection network

DOI10.1006/JPDC.2000.1640MaRDI QIDQ1581285zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

hypernetworksinterconnection network

Mathematics Subject Classification ID

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

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

Cited in

(3)

• scientific article; zbMATH DE number 1270450 (Why is no real title available?)
• The connected component of the partial duplication graph
• A comparative study of doubly connected directed topologies for LANs and MANs

Describes a project that uses

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)