On the sizes of permutation networks and consequences for efficient simulation of hypercube algorithms on bounded-degree networks

DOI10.1007/3-540-59042-0_78zbMath1379.68013OpenAlexW1583666161MaRDI QIDQ4596626

No author found.

Publication date: 4 December 2017

Published in: STACS 95 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-59042-0_78

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Related Items (3)

Unnamed Item ⋮ Communication in the two-way listen-in vertex-disjoint paths mode ⋮ Periodic comparator networks

This page was built for publication: On the sizes of permutation networks and consequences for efficient simulation of hypercube algorithms on bounded-degree networks