Smaller explicit superconcentrators

Authors:
N. Alon;M. Capalbo
Affiliations:
Tel Aviv University, Tel Aviv, Israel;Institute for Advanced Study, Princeton, NJ
Venue:
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Year:
2003

Citing 4
Cited 1

Expanders and diffusers

SIAM Journal on Algebraic and Discrete Methods
Better expanders and superconcentrators

Journal of Algorithms
Expanders obtained from affine transformations

Combinatorica - Theory of Computing
Existence and explicit constructions of q+1 regular Ramanujan graphs for every prime power q

Journal of Combinatorial Theory Series B

Smaller superconcentrators of density 28

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an explicit construction of an infinite family of N-superconcentrators of density 44. The most economical previously known explicit graphs of this type have density around 60.