On Constructing Expanders for Any Number of Vertices

DOI10.1007/978-3-030-43662-9_21OpenAlexW3014638838MaRDI QIDQ5098786FDOQ5098786

Authors: Oded Goldreich 

Publication date: 30 August 2022

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-43662-9_21

Recommendations

• On constructing expander families of G-graphs
• Expander graphs and their applications
• scientific article; zbMATH DE number 2196285
• On expansive graphs
• scientific article; zbMATH DE number 7052900
• Expander graphs in pure and applied mathematics
• On the Edge-Expansion of Graphs
• Gonality of expander graphs
• On expander graphs and connectivity in small space
• On the expansion of combinatorial polytopes

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Randomized algorithms (68W20)

Cites Work

• Expander graphs and their applications
• Computational Complexity
• Explicit expanders of every degree and size
• Title not available (Why is that?)

Cited In (5)

• Explicit expanders of every degree and size
• Title not available (Why is that?)
• On constructing expander families of G-graphs
• Expanders Are Universal for the Class of All Spanning Trees
• Expanders via local edge flips in quasilinear time

This page was built for publication: On Constructing Expanders for Any Number of Vertices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5098786)