This paper is a survey, from the point of view of a theoretical computer scientist, of efficient algorithms for the maximum flow problem. Included is a discussion of the most efficient known algorithm for sparse graphs, which makes use of a novel data structure for representing rooted trees. Also discussed are the potential practical significance of the algorithms and open problems.
|Original language||English (US)|
|Number of pages||11|
|Journal||Mathematical Programming Study|
|State||Published - Mar 1 1983|
All Science Journal Classification (ASJC) codes