scientific article; zbMATH DE number 221929

DOI10.1002/1520-6750(199304)40:3%3C393::AID-NAV3220400308%3E3.0.CO;2-1zbMATH Open0792.90026MaRDI QIDQ4697333FDOQ4697333

Authors: Gary R. Waissi 

Publication date: 29 June 1993

Title of this publication is not available (Why is that?)

Recommendations

• A new Karzanov-type \(O(n^ 3)\) max-flow algorithm
• An $o(n^3 )$-Time Maximum-Flow Algorithm
• A Fast and Simple Algorithm for the Maximum Flow Problem
• A new approach to the maximum-flow problem
• More efficient parallel flow algorithms

zbMATH Keywords

maximum value flowsdirected single-commodity networks

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Deterministic network models in operations research (90B10) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Cites Work

• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• A Simple Algorithm for Finding Maximal Network Flows and an Application to the Hitchcock Problem

This page was built for publication:

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