On the efficiency of maximum-flow algorithms on networks with small integer capacities-Reference-Cited by-同舟云学术

On the efficiency of maximum-flow algorithms on networks with small integer capacities

Published:1989-06 Issue:1-4 Volume:4 Page:173-189
ISSN:0178-4617
Container-title:Algorithmica
language:en
Short-container-title:Algorithmica

Author:

Fernández-Baca David,Martel Charles U.

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computer Science Applications,General Computer Science

Link

http://link.springer.com/content/pdf/10.1007/BF01553885.pdf

Reference20 articles.

1. Cherkaski, B. Algorithm for construction of maximal flow in networks with complexityO(¦V¦2¦E¦1/2) operations.Math. Methods Solutions Econ. Problems 7 (1977), 117–125 (in Russian—see also [GALI80]).

2. Cheung, T. Computational comparison of eight methods for the maximum flow problem.ACM Trans. Math. Software 6 (1980), 1–16.

3. Dinic, E. A. Algorithm for solution of a problem of maximum flow in a network with power estimation.Soviet Math. Dokl. 11 (1970), 1277–1280.

4. Even, S., and Tarjan, R. E. Network flow and testing graph connectivity.SIAM J. Comput. 4 (1975), 507–518.

5. Fernández-Baca, D. Improved Bounds on Network Flow Algorithms with Applications. Ph.D. Dissertation, Computer Science Division, University of California, Davis, CA, 1986.

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Maximum flow problem in wireless ad hoc networks with directional antennas;Optimization Letters;2006-08-08

2. AO(nm log(U/n)) time maximum flow algorithm;Naval Research Logistics;2000

3. Note: Open-shop scheduling with release dates to minimize maximum lateness;Naval Research Logistics;1995-02