On Near Optimal Spectral Expander Graphs of Fixed Size

09/29/2021
by   Clark Alexander, et al.
0

We present a pair of heuristic algorithms. The first is to generate a random regular graph of fixed size. The second is the introduction of the Metropolis Coupled Simulated Annealer (MCSA) for optimizing spectral gaps in fixed size regular graphs.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset