论文信息 - Explicit constructions of linear size superconcentrators

Explicit constructions of linear size superconcentrators

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.

Z. Galil | O. Gabber

[1] M. Murty. Ramanujan Graphs , 1965 .

[2] M. Pinsker,et al. On the complexity of a concentrator , 1973 .

[3] Leslie G. Valiant,et al. On non-linear lower bounds in computational complexity , 1975, STOC.

[4] Dana Angluin,et al. A Note on a Construction of Margulis , 1979, Inf. Process. Lett..

[5] Zvi Galil,et al. Explicit Constructions of Linear-Sized Superconcentrators , 1981, J. Comput. Syst. Sci..