acm-header
Sign In

Communications of the ACM

Latest Research


Latest Research Research Archive Refine your search:
dateMore Than a Year Ago
authorShang-Hua Teng

Spectral Sparsification of Graphs
From Communications of the ACM

Spectral Sparsification of Graphs: Theory and Algorithms

Graph sparsification is the approximation of an arbitrary graph by a sparse graph. We explain what it means for one graph to be a spectral approximation of another...
Sign In for Full Access
» Forgot Password? » Create an ACM Web Account