Permutation Groups, Complexes, and Rearrangeable Connecting Networks

DOI10.1002/j.1538-7305.1964.tb04102.xzbMath0129.30802OpenAlexW1965960902MaRDI QIDQ5338468

Václav E. Beneš

Publication date: 1964

Published in: Bell System Technical Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/j.1538-7305.1964.tb04102.x

zbMATH Keywords

probability theory

Related Items

Methods for message routing in parallel machines ⋮ Non-binary universal tree-based networks ⋮ A theory of decomposition into prime factors of layered interconnection networks ⋮ A universal tree-based network with the minimum number of reticulations ⋮ A survey of graphs with known or bounded crossing numbers