Efficient algorithms for checking the equivalence of multistage interconnection networks

DOI10.1016/J.JPDC.2003.09.003zbMath1072.68002OpenAlexW2053902426MaRDI QIDQ1878704

Tiziana Calamoneri, Annalisa Massini

Publication date: 8 September 2004

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

Full work available at URL: https://doi.org/10.1016/j.jpdc.2003.09.003

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10) Distributed systems (68M14)

Related Items (3)

Rearrangeability of bit permutation networks ⋮ A theory of decomposition into prime factors of layered interconnection networks ⋮ All-to-all personalized communication on multistage interconnection networks

This page was built for publication: Efficient algorithms for checking the equivalence of multistage interconnection networks