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 (US) |
|---|---|
| Pages | 340-346 |
| Number of pages | 7 |
| State | Published - 2003 |
| Externally published | Yes |
| Event | Configuralble Computing: Technology and Applications - Boston, MA, United States Duration: Nov 2 1998 → Nov 3 1998 |
Other
| Other | Configuralble Computing: Technology and Applications |
|---|---|
| Country/Territory | United States |
| City | Boston, MA |
| Period | 11/2/98 → 11/3/98 |
All Science Journal Classification (ASJC) codes
- Software
- General Mathematics