Superconcentration is a strong property of interconnection diagraphs. We characterize its negation by existence of two disjoint and seperated sets which shrink under the forward and backward neighbor relation, respectively. This enables a better, non-cascaded design of superconcentrators, explicit ones with edge density ≤ 118, random ones with edge density ≤ 13.
CITATION STYLE
Shamir, E. (1984). From expanders to better superconcentrators without cascading. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 166 LNCS, pp. 121–128). Springer Verlag. https://doi.org/10.1007/3-540-12920-0_11
Mendeley helps you to discover research relevant for your work.