Simplifications and speedups of the pseudoflow algorithm

DOI10.1002/net.21467zbMath1269.90129OpenAlexW2062922240WikidataQ59592288 ScholiaQ59592288MaRDI QIDQ5326778

Dorit S. Hochbaum, James B. Orlin

Publication date: 6 August 2013

Published in: Networks (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1721.1/77228

zbMATH Keywords

minimum cutmaximum flowdata structuredynamic treespseudoflow algorithm

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Data structures (68P05)

Related Items (3)

A recursive time aggregation-disaggregation heuristic for the multidimensional and multiperiod precedence-constrained knapsack problem: an application to the open-pit mine block sequencing problem ⋮ Enhanced instance space analysis for the maximum flow problem ⋮ A Faster Algorithm Solving a Generalization of Isotonic Median Regression and a Class of Fused Lasso Problems

Uses Software

• DIMACS
• MAXFLOW

Cites Work

• Unnamed Item
• Unnamed Item
• An \(O(IVI^3)\) algorithm for finding maximum flows in networks
• Computational investigations of maximum flow algorithms
• On implementing the push-relabel method for the maximum flow problem
• A data structure for dynamic trees
• Beyond the flow decomposition barrier
• Maximal Flow Through a Network
• The Pseudoflow Algorithm: A New Algorithm for the Maximum-Flow Problem
• A new approach to the maximum-flow problem
• Implementing Goldberg's max-flow-algorithm ? A computational investigation
• A Faster Deterministic Maximum Flow Algorithm
• A Computational Study of the Pseudoflow and Push-Relabel Algorithms for the Maximum Flow Problem

This page was built for publication: Simplifications and speedups of the pseudoflow algorithm