Abstract
We prove that a strictly non-blockingn-connector of depthk must haveω(n 1+1/(k−1)) edges.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
C. Clos, A Study of non-blocking switching networks,Bell. Sys. Tech. J.,32 (1953), 406–424.
N. Pippenger andL. Valiant, Shifting graphs and their applications,J. ACM,23 (1976), 423–432.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Friedman, J. A lower bound on strictly non-blocking networks. Combinatorica 8, 185–188 (1988). https://doi.org/10.1007/BF02122799
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02122799