## Smaller explicit superconcentrators.(English)Zbl 1094.68600

Proceedings of the fourteenth annual ACM-SIAM symposium on discrete algorithms, Baltimore, MD, USA, January 12–14, 2003. New York, NY: Association for Computing Machinery; Philadelphia, PA: Society for Industrial and Applied Mathematics (ISBN 0-89871-538-5/pbk). 340-346 (2003).
Summary: 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.
For the entire collection see [Zbl 1006.00017].

### MSC:

 68R10 Graph theory (including graph drawing) in computer science