Computational Comparison of Eight Methods for the Maximum Network Flow Problem

Authors:
To-Yat Cheung
Affiliations:
Department of Computer Science, University of Ottawa, Ottawa, Ontano, Canada
Venue:
ACM Transactions on Mathematical Software (TOMS)
Year:
1980

Citing 6
Cited 1

Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems

Journal of the ACM (JACM)
Accelerated Algorithms for Labeling and Relabeling of Trees, with Applications to Distribution Problems

Journal of the ACM (JACM)
Flow Switching Approach to the Maximum Flow Problem: I

Journal of the ACM (JACM)
Certification of algorithm 266 [G5]

Communications of the ACM
Algorithms: Algorithm 324: Maxflow

Communications of the ACM
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms

Multifacility Location Problem with Rectilinear Distance by the Minimum-Cut Approach

ACM Transactions on Mathematical Software (TOMS)

Quantified Score

Hi-index	0.00

Visualization

Abstract