Skip to content

Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems.

Daniel A. Spielman, Shang-Hua Teng

VenueA*STOC
Year2004
ProceedingsSTOC

Browse the full STOC paper archive.