1 paper · 1 filter
Catherine Babecki, Stefan Steinerberger, Rekha R. Thomas
We propose an approach to graph sparsification based on the idea of preserving the smallest k eigenvalues and eigenvectors of the Graph Laplacian. This is motivated by the fact t…