Recursive construction for 3-regular expanders
type: Item
instance of: scholarly article
title: Recursive construction for 3-regular expanders
zbMATH Open document ID: 0810.05046
DOI: 10.1007/BF01302963
published in: Combinatorica
publication date: 1995-02-01T00:00:00Z
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 716340
zbMATH Keywords: algorithm
zbMATH Keywords: expander graph
zbMATH Keywords: number of cycles
author: Miklós Ajtai
MaRDI profile type: Publication
cites work: A note on time-space tradeoffs for computing continuous functions
cites work: Sorting in \(c \log n\) parallel steps
cites work: Optimal parallel selection has complexity O(log log N)
cites work: \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
cites work: Explicit constructions of linear-sized superconcentrators
cites work: Ramanujan graphs
cites work: Superconcentrators
cites work: Sorting and Selecting in Rounds
cites work: Graph-theoretic properties in computational complexity
full work available at URL: https://doi.org/10.1007/bf01302963
OpenAlex ID: W2032230430
description: scientific article; zbMATH DE number 716340