We slightly improve the superconcentrator construction by Alon and Capalbo.
This is a preview of subscription content, access via your institution.
Buy single article
Instant access to the full article PDF.
Tax calculation will be finalised during checkout.
Alon, N. and Capalbo, M., Smaller Explicit Superconcentrators, Internet Math., 2004, vol. 1, no. 2, pp. 151–163.
Pinsker, M.S., On the Complexity of a Concentrator, in Proc. 7th Int. Teletraffic Conf. (ITC 7), Stockholm, Sweden, June 13-20, 1973, pp. 318/1–318/4.
Kolmogorov, A. N. and Barzdin', Ya.M., On the Realization of Networks in Three-Dimensional Space, Probl. Kibern., 1967, vol. 19, pp. 261–268.
Bassalygo, L.A., Asymptotically Optimal Switching Circuits, Probl. Peredachi Inf., 1981, vol. 17, no. 3, pp. 81–88 [Probl. Inf. Transm. (Engl. Transl.), 198, vol. 17, no. 3, pp. 206–211].
Schöning, U., Construction of Expanders and Superconcentrators Using Kolmogorov Complexity, Random Structures Algorithms, 2000, vol. 17, no. 1, pp. 64–77.
Schöning, U., Smaller Superconcentrators of Density 28, Inform. Process. Lett., 2006, vol. 98, no. 4, pp. 127–129.
The research was supported in part by the Russian Foundation for Basic Research, project no. 19-01-00364.
Russian Text © The Author(s), 2019, published in Problemy Peredachi Informatsii, 2019, Vol. 55, No. 3, pp. 106–108.
This article has been retracted. Please see the retraction notice for more detail: https://doi.org/10.1134/S0032946020040092
About this article
Cite this article
Bassalygo, L.A. RETRACTED ARTICLE: Note on “Smaller Explicit Superconcentrators” by N. Alon and M. Capalbo. Probl Inf Transm 55, 295–297 (2019). https://doi.org/10.1134/S0032946019030086
- expander graph