Theoretical Efficiency of the Edmonds-Karp Algorithm for Computing Maximal Flows

DOI10.1145/321679.321693zbMath0237.90057OpenAlexW2049084163MaRDI QIDQ5648164

Norman Zadeh

Publication date: 1972

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/321679.321693

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (7)

Affirmative action algorithms ⋮ The multicommodity assignment problem: A network aggregation heuristic ⋮ On the theoretical efficiency of various network flow algorithms ⋮ More pathological examples for network flow problems ⋮ Decomposition algorithms for minimal cut problems ⋮ Decomposition algorithms for locating minimal cuts in a network ⋮ A bad network problem for the simplex method and other minimum cost flow algorithms

This page was built for publication: Theoretical Efficiency of the Edmonds-Karp Algorithm for Computing Maximal Flows