OPTIMAL LAYOUT OF TRIVALENT CAYLEY INTERCONNECTION NETWORKS

DOI10.1142/S0129054199000204zbMath1319.68154OpenAlexW1997606083MaRDI QIDQ5249004

Rossella Petreschi, Tiziana Calamoneri

Publication date: 29 April 2015

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054199000204

zbMATH Keywords

cubic graphsinterconnection networklayouttrivalent Cayley networks

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Related Items (1)

On the pagenumber of trivalent Cayley graphs

Cites Work

• Shortest routing in trivalent Cayley graph network
• Trivalent Cayley graphs for interconnection networks
• Hamilton cycles in Trivalent Cayley graphs
• The de Bruijn multiprocessor network: a versatile parallel processing and sorting network for VLSI

This page was built for publication: OPTIMAL LAYOUT OF TRIVALENT CAYLEY INTERCONNECTION NETWORKS