scientific article; zbMATH DE number 515922

MaRDI QIDQ4283434zbMATH OpenFDO

Authors Richard J. Anderson, João C. Setubal

Publication date 10 March 1994

zbMATH Keywords

Goldberg's algorithmmaximum flowperiodic global relabeling

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Software, source code, etc. for problems pertaining to computer science (68-04) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Deterministic network models in operations research (90B10)

Recommendations

• Implementing Goldberg's max-flow-algorithm ? A computational investigation
• scientific article; zbMATH DE number 515923
• Computational investigations of maximum flow algorithms
• scientific article; zbMATH DE number 1022488
• A computational study of the pseudoflow and push-relabel algorithms for the maximum flow problem

Cited in

(13)

• An algorithmic study of the maximum flow problem: A comparative statistical analysis
• An auction algorithm for the max-flow problem
• An efficient cost scaling algorithm for the assignment problem
• Efficient preflow push algorithms
• A compaction scheme and generator for distribution networks
• Implementing Goldberg's max-flow-algorithm ? A computational investigation
• scientific article; zbMATH DE number 515923 (Why is no real title available?)
• scientific article; zbMATH DE number 515926 (Why is no real title available?)
• scientific article; zbMATH DE number 1022488 (Why is no real title available?)
• Recent developments in maximum flow algorithms
• On implementing push-relabel method for the maximum flow problem
• A self-stabilizing algorithm for the maximum flow problem
• A computational study of the pseudoflow and push-relabel algorithms for the maximum flow problem

This page was built for publication:

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