acm-header
Sign In

Communications of the ACM

Latest Research

Technical Perspective: Maximum Flow through a Network: A Storied Problem and a Groundbreaking Solution
From Communications of the ACM

Technical Perspective: 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... Shang-Hua Teng
From Communications of the ACM | December 2023
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... Joshua Batson, Daniel A. Spielman, Nikhil Srivastava, Shang-Hua Teng
From Communications of the ACM | August 2013
Sign In for Full Access
» Forgot Password? » Create an ACM Web Account