ALGORITHMS FOR MAXIMUM NETWORK FLOW.

Research output: Contribution to journalArticle

13 Scopus citations

Abstract

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 languageEnglish (US)
Pages (from-to)1-11
Number of pages11
JournalMathematical Programming Study
Volume26
StatePublished - Mar 1 1983
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Engineering(all)

Fingerprint Dive into the research topics of 'ALGORITHMS FOR MAXIMUM NETWORK FLOW.'. Together they form a unique fingerprint.

  • Cite this