The maximum flow problem: a real-time approach

DOI10.1016/S0167-8191(03)00022-XMaRDI QIDQ436202zbMATH OpenOpenAlexFDO

Authors Naya Nagy, Selim G. Akl

Publication date 30 July 2012

Published in Parallel Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0167-8191(03)00022-x

zbMATH Keywords

maximum flowparallelismreal-time computationaccuracy ratioasymptotic improvement in qualitycumulative errormodule allocationreconfigurable multiple bus machine

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40) Parallel algorithms in computer science (68W10)

Recommendations

• A new approach to the maximum-flow problem
• scientific article; zbMATH DE number 177817
• A Fast and Simple Algorithm for the Maximum Flow Problem
• Constructing maximal dynamic flows from static flows
• The maximum flow in dynamic networks

Cited in

(4)

• A real-time methodology for minimizing mean flowtime in FMSs with routing flexibility: threshold-based alternate routing
• Solving Maximum Flow Problems on Real World Bipartite Graphs
• On solving maximum and quickest interval-valued flows over time
• A case study in real-time parallel computation: Correcting algorithms

This page was built for publication: The maximum flow problem: a real-time approach

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