Sign In

Communications of the ACM

Research Highlights

Technical Perspective: Maximum Flow through a Network: A Storied Problem and a Groundbreaking Solution

abstract lines, illustration

Credit: Getty Images

In 2022, a team of computer scientists presented a groundbreaking algorithm for the maximum flow problem: How does one transport the most supplies from a source node to a sink node in a network while respecting link capacities? This result has a wide impact on algorithmic theory because this storied problem has broad theoretical significance and practical applications.

Maximum flow is an exemplary theoretical model of a real-world scenario. In an interdisciplinary collaboration, Ted Harris, a RAND mathematician, and General Frank Ross, a former chief of the Army's Transportation Corps in Europe, aided by George Dantzig, formulated the problem when studying rail transportation in the 1950s. The flow problem is intrinsically related to the minimum-cut problem via the mathematical duality: "maximum flow is equal to minimum cut." While the flow measures how well two nodes are connected, the dual cut measures how much capacity must be destroyed to disconnect them. Both are central in optimization and have multiple fundamental applications, including bipartite matching and divide-and-conquer-based approximations. They are also tools for solving practical tasks, including image processing, DNA sequence alignment, circuit design, and finite-element simulation.


No entries found

Log in to Read the Full Article

Sign In

Sign in using your ACM Web Account username and password to access premium content if you are an ACM member, Communications subscriber or Digital Library subscriber.

Need Access?

Please select one of the options below for access to premium content and features.

Create a Web Account

If you are already an ACM member, Communications subscriber, or Digital Library subscriber, please set up a web account to access premium content on this site.

Join the ACM

Become a member to take full advantage of ACM's outstanding computing information resources, networking opportunities, and other benefits.

Subscribe to Communications of the ACM Magazine

Get full access to 50+ years of CACM content and receive the print version of the magazine monthly.

Purchase the Article

Non-members can purchase this article or a copy of the magazine in which it appears.