Shang-Hua Teng – Communications of the ACM

Research Highlights Dec 13 2023

Maximum Flow Through a Network: A Storied Problem and a Groundbreaking Solution

“Almost-Linear-Time Algorithms for Maximum Flow and Minimum-Cost Flow,” by Li Chen et al., comes within striking distance of answering the question: “Does maximum flow have a scalable algorithm?”

Systems and Networking

Author Archives

Research and Advances Aug 1 2013

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 and review the development of algorithms for spectral sparsification.

Research and Advances Oct 1 2009

Smoothed Analysis: An Attempt to Explain the Behavior of Algorithms in Practice

This Gödel Prize-winning work traces the steps toward modeling real data.

Systems and Networking

Shape the Future of Computing

ACM encourages its members to take a direct hand in shaping the future of the association. There are more ways than ever to get involved.

Get Involved