Permutation Groups, Complexes, and Rearrangeable Connecting Networks
Author:
- V. E. BenešVBV. E. Beneš
- 29 July 1964
- journal article
- website
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Bell System Technical Journal
- Vol. 43 (4) , 1619-1640
Abstract
In the interest of providing good telephone service with efficient connecting networks, it is desirable to have at hand a knowledge of some of the combinatorial properties of such networks. One of these properties is rearrangeability: a connecting ne...Keywords
This publication has 1 reference indexed in Scilit:
- On Representatives of SubsetsJournal of the London Mathematical Society, 1935