On the Size of Permutation Networks and Consequences for Efficient Simulation of Hypercube Algorithms on Bounded-Degree Networks

DOI10.1137/060669164zbMath1214.68035OpenAlexW1970639352MaRDI QIDQ3583331

Hubert Wagener, Przemysawa Kanarek, Ralf Klasing, Juraj Hromkovič, Walter Unger, Krzysztof Lory

Publication date: 27 August 2010

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/060669164

zbMATH Keywords

communication networks parallel algorithms switching networks network design and communication permutation networks

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Parallel algorithms in computer science (68W10) Mathematical problems of computer architecture (68M07)

This page was built for publication: On the Size of Permutation Networks and Consequences for Efficient Simulation of Hypercube Algorithms on Bounded-Degree Networks