From expanders to better superconcentrators without cascading

  • Eli Shamir
Contibuted Papers

DOI: 10.1007/3-540-12920-0_11

Part of the Lecture Notes in Computer Science book series (LNCS, volume 166)
Cite this paper as:
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

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1984

Authors and Affiliations

  • Eli Shamir
    • 1
  1. 1.Institut of Mathematics and Computer ScienceHebrew UniversityJerusalem

Personalised recommendations