An incremental algorithm for the maximum flow problem

DOI10.1023/A:1023607406540MaRDI QIDQ1398018zbMATH OpenOpenAlexFDO

Authors D. Massart, Somesh Kumar, P. Gupta

Publication date 6 August 2003

Published in JMMA. Journal of Mathematical Modelling and Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1023607406540

zbMATH Keywords

combinatorial optimizationincremental computationmaximum flownetwork flows

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)

Recommendations

• Maximum flows by incremental breadth-first search
• A Fast and Simple Algorithm for the Maximum Flow Problem
• scientific article; zbMATH DE number 706868
• A Faster Deterministic Maximum Flow Algorithm
• scientific article; zbMATH DE number 742960
• Faster and more dynamic maximum flow by incremental breadth-first search
• scientific article; zbMATH DE number 1022488
• A new approach to the maximum-flow problem
• A fast maximum flow algorithm
• On the maximum capacity augmentation algorithm for the maximum flow problem

Cited in

(6)

• Maximum flow problem in wireless ad hoc networks with directional antennas
• Incremental network optimization: theory and algorithms
• A new approach for solving the network problems
• An Incremental Model for Combinatorial Maximization Problems
• Incremental network design with maximum flows
• Recent advances in fully dynamic graph algorithms (invited talk)

This page was built for publication: An incremental algorithm for the maximum flow problem

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