Expanders obtained from affine transformations
From MaRDI portal
Publication:1098859
DOI10.1007/BF02579322zbMath0637.05017MaRDI QIDQ1098859
Publication date: 1987
Published in: Combinatorica (Search for Journal in Brave)
Related Items
On the relationship between the diameter and the size of a boundary of a directed graph, On using deterministic functions to reduce randomness in probabilistic algorithms, Local expanders, Pseudorandom generators for combinatorial checkerboards, Expander graphs and their applications, SIMULATING AN R-MESH ON AN LR-MESH IN CONSTANT TIME, Diameters and Eigenvalues
Cites Work
- Eigenvalues and expanders
- Asymptotically optimal switching circuits
- Explicit constructions of linear-sized superconcentrators
- On Concentrators, Superconcentrators, Generalizers, and Nonblocking Networks
- Limitations on Explicit Constructions of Expanding Graphs
- Combinatorial Lower Bound Arguments for Deterministic and Nondeterministic Turing Machines
- Better expanders and superconcentrators
- Superconcentrators