scientific article; zbMATH DE number 176469

MaRDI QIDQ4035631zbMATH OpenFDO

Authors

Publication date 18 May 1993

zbMATH Keywords

maximum flowpreflow-push algorithmscaling

Mathematics Subject Classification ID

Computational methods for problems pertaining to operations research and mathematical programming (90-08) Deterministic network models in operations research (90B10) Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Analysis of Preflow Push Algorithms for Maximum Network Flow
• The maximum flow problem: A max-preflow approach
• Some Recent Advances in Network Flows
• scientific article; zbMATH DE number 4079142
• On the complexity of preflow-push algorithms for maximum-flow problems

Cited in

(5)

• Efficient preflow push algorithms
• An analysis of the highest-level selection rule in the preflow-push max-flow algorithm
• scientific article; zbMATH DE number 4079142 (Why is no real title available?)
• On implementing push-relabel method for the maximum flow problem
• The maximum flow problem: A max-preflow approach

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