Dynamic random expander graphs generator
An implementation and report of the twice Ramanujan graph sparsifiers.
Flagship executable URF/Chronos implementation with verified build and test surface
Predictor–verifier framework for efficient iterative spectral optimisation of regular graphs using recycled Ritz subspaces.
Add a description, image, and links to the expanders topic page so that developers can more easily learn about it.
To associate your repository with the expanders topic, visit your repo's landing page and select "manage topics."