Theory and methodologyA parametric maximum flow algorithm for bipartite graphs with applications
References (12)
- et al.
An O(v3) algorithm for finding maximum flows in networks
Information Processing Letters
(1978) An improved algorithm for scheduling jobs on heterogenuous processors
Algorithms for solution of a problem of maximum flow in a network with power estimation
Soviet Mathematics. Doklady
(1970)- et al.
Theoretical improvements in algorithmic efficiency for network flow problems
Journal of the ACM
(1972) - et al.
Mathematical techniques for efficient record segmentation in large shared databases
Journal of the ACM
(1976) - et al.
A fast parametric flow algorithm and applications
SIAM Journal on Computing
(1989)
There are more references available in the full text version of this article.
Cited by (0)
Copyright © 1995 Published by Elsevier B.V.