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...

Almost-Linear-Time Algorithms for Maximum Flow and Minimum-Cost Flow
From Communications of the ACM

Almost-Linear-Time Algorithms for Maximum Flow and Minimum-Cost Flow

We present an algorithm that computes exact maximum flows and minimum-cost flows on directed graphs with m edges and polynomially bounded integral demands, costs...
Sign In for Full Access
» Forgot Password? » Create an ACM Web Account