scientific article; zbMATH DE number 515923
From MaRDI portal
Publication:4283435
zbMATH Open0787.90025MaRDI QIDQ4283435FDOQ4283435
Authors:
Publication date: 10 March 1994
Title of this publication is not available (Why is that?)
Recommendations
- Implementing Goldberg's max-flow-algorithm ? A computational investigation
- scientific article; zbMATH DE number 515922
- On implementing the push-relabel method for the maximum flow problem
- On the complexity of preflow-push algorithms for maximum-flow problems
- Efficient implementation of the Goldberg–Tarjan minimum-cost flow algorithm
Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Cited In (9)
- Title not available (Why is that?)
- On implementing push-relabel method for the maximum flow problem
- An efficient cost scaling algorithm for the assignment problem
- Title not available (Why is that?)
- Computational investigations of maximum flow algorithms
- Implementing Goldberg's max-flow-algorithm ? A computational investigation
- Implementing the Ford-Fulkerson labeling algorithm with fixed-order scanning
- Recent developments in maximum flow algorithms
- An auction algorithm for the max-flow 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 Q4283435)
