Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
L.A. Bassalygo, Asymptotically optimal swiching circuits. Problems of Information Transmission (1981), 206–211. [in Russian].
O. Gabber and Z. Galil, Explicit construction of linear size superconcentrators. Proc. of IEEE 20th FOCS Conference 1971, 364–370.
G.R. Grimmett and H. Kesten, First — passage perculation, network flows and electrical resistances 1982 (to appear).
G. A. Margulis, Explicit construction of concentrators. Problems of Information Transmissiom 9 (1973), 71–80 [in Russian, English translation plenum 1975]
E. Shamir and E. Upfal, 1 — factor in random graphs based on vertex choice. Discrete Math. 41 (1982), 281–286.
E. Shamir and E. Upfal, On factors in random graphs. Israel J. of Math. 39 (1981), 296–301.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1984 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Shamir, E. (1984). From expanders to better superconcentrators without cascading. In: Fontet, M., Mehlhorn, K. (eds) STACS 84. STACS 1984. Lecture Notes in Computer Science, vol 166. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-12920-0_11
Download citation
DOI: https://doi.org/10.1007/3-540-12920-0_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-12920-2
Online ISBN: 978-3-540-38805-0
eBook Packages: Springer Book Archive