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

DOI10.1145/321679.321693MaRDI QIDQ5648164zbMATH OpenOpenAlexFDO

Authors 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)

Cited in

(7)

• The multicommodity assignment problem: A network aggregation heuristic
• On the theoretical efficiency of various network flow algorithms
• Affirmative action algorithms
• 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
• More pathological examples for network flow problems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5648164)