Smaller Explicit Superconcentrators
N. Alon and M. Capalbo
Source: Internet Math. Volume 1, Number 2
(2003), 151-163.
Abstract
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.
First Page:
Show
Hide
Full-text: Open access
Links and Identifiers
Internet Mathematics
