Permutation Groups, Complexes, and Rearrangeable Connecting Networks

DOI10.1002/J.1538-7305.1964.TB04102.XMaRDI QIDQ5338468zbMATH OpenOpenAlexFDO

Authors 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

Cited in

(7)

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

This page was built for publication: Permutation Groups, Complexes, and Rearrangeable Connecting Networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5338468)