Smaller explicit superconcentrators

d Abstract) N. Alon ∗ M. Capalbo † July 28, 2002 Using a new recursive technique, 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.

• Type: Conference
• Year: 2003
• Where: SODA
• Authors: Noga Alon, Michael R. Capalbo
• Keywords: Algorithms, Explicit Construction, Explicit Graphs, Infinite Family, SODA 2003