Smaller explicit superconcentrators

N. Alon; M. Capalbo

doi:10.1080/15427951.2004.10129083

Smaller explicit superconcentrators

N. Alon, M. Capalbo

Research output: Contribution to journal › Article › peer-review

12 Scopus citations

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.

Original language	English (US)
Pages (from-to)	151-163
Number of pages	13
Journal	Internet Mathematics
Volume	1
Issue number	2
DOIs	https://doi.org/10.1080/15427951.2004.10129083
State	Published - 2004
Externally published	Yes

All Science Journal Classification (ASJC) codes

Modeling and Simulation
Computational Mathematics
Applied Mathematics

Access to Document

10.1080/15427951.2004.10129083

Cite this

@article{4e1f197c99aa4d22a24292100fa7b0b1,

title = "Smaller explicit superconcentrators",

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.",

author = "N. Alon and M. Capalbo",

note = "Funding Information: We would like to thank Alex Lubotzky for helpful discussions. N. Alon{\textquoteright}s research was supported in part by a USA Israeli BSF grant, by a grant from the Israel Science Foundation, and by the Hermann Minkowski Minerva Center for Geometry at Tel Aviv University. M. Capalbo{\textquoteright}s research was supported by NSF grant CCR98210-58.",

year = "2004",

doi = "10.1080/15427951.2004.10129083",

language = "English (US)",

volume = "1",

pages = "151--163",

journal = "Internet Mathematics",

issn = "1542-7951",

publisher = "Taylor and Francis Ltd.",

number = "2",

}

TY - JOUR

T1 - Smaller explicit superconcentrators

AU - Alon, N.

AU - Capalbo, M.

N1 - Funding Information: We would like to thank Alex Lubotzky for helpful discussions. N. Alon’s research was supported in part by a USA Israeli BSF grant, by a grant from the Israel Science Foundation, and by the Hermann Minkowski Minerva Center for Geometry at Tel Aviv University. M. Capalbo’s research was supported by NSF grant CCR98210-58.

PY - 2004

Y1 - 2004

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=33644914043&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33644914043&partnerID=8YFLogxK

U2 - 10.1080/15427951.2004.10129083

DO - 10.1080/15427951.2004.10129083

M3 - Article

AN - SCOPUS:33644914043

SN - 1542-7951

VL - 1

SP - 151

EP - 163

JO - Internet Mathematics

JF - Internet Mathematics

IS - 2

ER -

Smaller explicit superconcentrators

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this