Comparative study of product networks

DOI10.1006/JPDC.2001.1770MaRDI QIDQ1604293zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

Cartesian product of interconnection networksproduct networks

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

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

Cited in

(9)

• Product-shuffle networks: Toward reconciling shuffles and butterflies
• The hyperstar interconnection network
• Matching preclusion number in product graphs
• Matching preclusion and conditional matching preclusion for regular interconnection networks
• On partial Cartesian product of scale-free network models
• Product networks:a family of symmetric interconnection networks from a group model
• PRODUCT OF QUASI-GROUP GRAPHS AS INTERCONNECTION NETWORK TOPOLOGIES
• On anti-Kekulé and s-restricted matching preclusion problems
• Performance modeling of Cartesian product networks

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)