Comparative study of product networks

DOI10.1006/JPDC.2001.1770zbMATH Open1006.68001OpenAlexW2013993114MaRDI QIDQ1604293FDOQ1604293

Authors: Abdel-Elah Al-Ayyoub, K. Day 

Publication date: 4 July 2002

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

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

Recommendations

• The hyperstar interconnection network
• Product networks:a family of symmetric interconnection networks from a group model
• Product-shuffle networks: Toward reconciling shuffles and butterflies
• Cost-performance tradeoffs for interconnection networks
• PRODUCT OF QUASI-GROUP GRAPHS AS INTERCONNECTION NETWORK TOPOLOGIES

zbMATH Keywords

product networksCartesian product of interconnection networks

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Cited In (7)

• Product networks:a family of symmetric interconnection networks from a group model
• On anti-Kekulé and \(s\)-restricted matching preclusion problems
• Matching preclusion and conditional matching preclusion for regular interconnection networks
• Product-shuffle networks: Toward reconciling shuffles and butterflies
• On partial Cartesian product of scale-free network models
• Performance modeling of Cartesian product networks
• Matching preclusion number in product graphs

This page was built for publication: Comparative study of product networks

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