Abstract
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.
| Original language | English |
|---|---|
| Pages | 340-346 |
| Number of pages | 7 |
| State | Published - 2003 |
| Event | Configuralble Computing: Technology and Applications - Boston, MA, United States Duration: 2 Nov 1998 → 3 Nov 1998 |
Conference
| Conference | Configuralble Computing: Technology and Applications |
|---|---|
| Country/Territory | United States |
| City | Boston, MA |
| Period | 2/11/98 → 3/11/98 |