Smaller Bound of Superconcentrator

A Superconcentrator is a directed acyclic graph with specific properties. The existence of linear-sized supercentrator has been proved in [4]. Since then, the size has been decreased significantly. The best known size is 28N which is proved by U. Schöning in [8]. Our work follows their construction and proves a smaller size superconcentrator. key words: expander, superconcentrator, theoretical computer science

[1]  Uwe Schöning.  Smaller superconcentrators of density 28 , 2006, Inf. Process. Lett..

[2]  Zvi Galil,et al.  Explicit constructions of linear size superconcentrators , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[3]  Noga Alon,et al.  Smaller Explicit Superconcentrators , 2003, Internet Math..

[4]  Uwe Schöning.  Construction of expanders and superconcentrators using Kolmogorov complexity , 2000 .

[5]  F. Chung.  On concentrators, superconcentrators, generalizers, and nonblocking networks , 1979, The Bell System Technical Journal.

[6]  Leslie G. Valiant,et al.  Size Bounds for Superconcentrators , 1983, Theor. Comput. Sci..