On the complexity of preflow-push algorithms for maximum-flow problems

DOI10.1007/BF01187018MaRDI QIDQ1322568zbMATH OpenOpenAlexFDO

Authors Levent Tunçel

Publication date 12 January 1995

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01187018

zbMATH Keywords

complexitynetwork flowsmaximum flowpreflow-push algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10)

Recommendations

• Analysis of Preflow Push Algorithms for Maximum Network Flow
• scientific article; zbMATH DE number 4079142
• Computational investigations of maximum flow algorithms
• A new approach to the maximum-flow problem
• An analysis of the highest-level selection rule in the preflow-push max-flow algorithm

Cites work

• scientific article; zbMATH DE number 177817 (Why is no real title available?)
• A new approach to the maximum-flow problem
• Analysis of Preflow Push Algorithms for Maximum Network Flow
• Finding Minimum-Cost Circulations by Successive Approximation

Cited in

(7)

• scientific article; zbMATH DE number 515923 (Why is no real title available?)
• Maximum flow problem in wireless ad hoc networks with directional antennas
• scientific article; zbMATH DE number 4079142 (Why is no real title available?)
• An analysis of the highest-level selection rule in the preflow-push max-flow algorithm
• scientific article; zbMATH DE number 176469 (Why is no real title available?)
• Efficient preflow push algorithms
• Analysis of Preflow Push Algorithms for Maximum Network Flow

This page was built for publication: On the complexity of preflow-push algorithms for maximum-flow problems

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