Smaller superconcentrators of density 28

DOI10.1016/j.ipl.2006.01.006zbMath1185.68496OpenAlexW2083431088MaRDI QIDQ844173

Uwe Schoening

Publication date: 18 January 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2006.01.006

zbMATH Keywords

computational complexitycombinatorial problemsuperconcentrator

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Related Items

Proof of Space from Stacked Expanders, Note on ``Smaller explicit superconcentrators, Minimal selectors and fault tolerant networks

Cites Work

• Unnamed Item
• Unnamed Item
• Asymptotically optimal switching circuits
• On Concentrators, Superconcentrators, Generalizers, and Nonblocking Networks
• Hard examples for resolution
• Superconcentrators
• Space bounds for a game on graphs
• Construction of expanders and superconcentrators using Kolmogorov complexity
• Smaller Explicit Superconcentrators