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.

翻译：我们展示了一对疲劳主义算法。 第一个是随机生成一个固定大小的常规图。 第二个是引入大都会组合模拟安妮纳勒(MCSA),以优化固定大小常规图中的光谱差距。