Martin Charles Golumbic, Renu C. Laskar
Discrete Applied Mathematics
Switching networks of the type used in telephone exchanges are studied, with emphasis on a particular class of networks possessing great structural symmetry. This class contains rearrangeable networks carrying N calls with roughly 6N log3 N contacts, and non-blocking networks with roughly 16N(log5 N)2 contacts; these results are the best obtainable by the methods used. We also show, by an impractical argument, that there are non-blocking networks with roughly 90N log3 N contacts. © 1978.
Martin Charles Golumbic, Renu C. Laskar
Discrete Applied Mathematics
Imran Nasim, Melanie Weber
SCML 2024
David L. Shealy, John A. Hoffnagle
SPIE Optical Engineering + Applications 2007
Frank R. Libsch, Takatoshi Tsujimura
Active Matrix Liquid Crystal Displays Technology and Applications 1997