scientific article; zbMATH DE number 515924

MaRDI QIDQ4283436zbMATH OpenFDO

Authors T. Badics, Endre Boros

Publication date 10 March 1994

zbMATH Keywords

dynamic trees data structuremaximum flow algorithm

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to computer science (68-04) Data structures (68P05) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Deterministic network models in operations research (90B10)

Recommendations

• A new approach to the maximum-flow problem
• Implementing Goldberg's max-flow-algorithm ? A computational investigation
• Algorithms for maximum network flow
• Minimum flow algorithms. Dynamic tree implementations
• The maximum flow problem: A max-preflow approach

Cited in

(4)

• Use of dynamic trees in a network simplex algorithm for the maximum flow problem
• Computational investigations of maximum flow algorithms
• Minimum flow algorithms. Dynamic tree implementations
• Maximal flow in branching trees and binary search trees

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 Q4283436)