Network Flow Algorithms

Network Flow Algorithms, 1st Edition, is a graduate-level textbook and reference covering combinatorial algorithms for network flow problems. The work provides an up-to-date, unified presentation of efficient algorithmic techniques developed across theoretical computer science, operations research, and discrete mathematics.

The text focuses on core combinatorial optimization methods used to route flows and identify cuts in structured networks. It also explores practical applications of the theory, including models for the transportation of goods and information.

Written for graduate students and professional researchers, the volume integrates recent work on electrical flows. It shows how these modern computational perspectives offer fresh insights into classical questions in network flow theory.