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

DOI10.1007/BF01187018zbMath0804.68067OpenAlexW1817251752MaRDI QIDQ1322568

Tunçel, Levent

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)

Related Items (3)

An analysis of the highest-level selection rule in the preflow-push max-flow algorithm ⋮ Maximum flow problem in wireless ad hoc networks with directional antennas ⋮ Efficient preflow push algorithms

Cites Work

• Analysis of Preflow Push Algorithms for Maximum Network Flow
• Finding Minimum-Cost Circulations by Successive Approximation
• A new approach to the maximum-flow problem
• Unnamed Item

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