|
Organizers |
Parallel algorithm for generalised flow problem
by
Goranka Nogo
Department of Mathematics, University of Zagreb, Zagreb, Croatia
The generalised flow problem is given by a flow network (G(V, E), u , s, t ) and a gain function \gamma: E --> R > 0 . If f(v, w) units are send from v to w, \gamma(v, w)f(v, w) units arrive to w. The generalised flow problem is that of finding a function f that satisfies the conservation constraints for all vertices except s and t and maximizes the net flow into the sink ef(t): = \sum (v, t) in E \gamma(v, t) f(v, t) = - \sum(t, v) in E f(t, v) . In this talk I will present one parallel algorithm for solving the generalised network flow problem.
Date received: March 8, 2000
Copyright © 2000 by the author(s). The author(s) of this document and the organizers of the conference have granted their consent to include this abstract in Atlas Conferences Inc. Document # cadz-40.