A lower bound on strictly non-blocking networks (Q1111529)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A lower bound on strictly non-blocking networks |
scientific article; zbMATH DE number 4074979
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A lower bound on strictly non-blocking networks |
scientific article; zbMATH DE number 4074979 |
Statements
A lower bound on strictly non-blocking networks (English)
0 references
1988
0 references
We prove that a strictly non-blocking n-connector of depth k must have \(\Omega (n^{1+1/(k-1)})\) edges.
0 references
