Skip to main content
SpringerLink
Log in

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

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract

The performance of maximum-flow algoirthms that work in phases is studied as a function of the maximum arc capacity,C, of the network and a quantity we call thetotal potential, P, of the network, which is related to the average amount of flow that can be sent through a node. Extending results by Even and Tarjan, we derive a tightO(min{C 1/3¦V¦2/3,P 1/2, ¦V¦}) upper bound on the number of phases. AnO(min{P log¦V¦,C¦V¦3/2, ¦V¦2¦E¦}) upper bound is derived on the total length of the augmenting paths used by Dinic's algorithm. The latter quantity is useful in estimating the performance of Dinic's method on certain inputs. Our results show that on a natural class of networks, the performance of Dinic's algorithm is significantly better than would be apparent from a bound based on ¦V¦ and ¦E¦ alone. We present an application of our bounds to the maximum subgraph density problem.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  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]).

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  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.

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  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.

    Google Scholar 

  6. Gabow, H. N. Scaling algorithms for network problems.Proceedings of the 24th Annual IEEE Symposium on Foundations of Computer Science, 1983, pp. 248–257.

  7. Galil, Z. AnO(V 5/3 E 2/3) algorithm for the maximal flow problem.Acta Inform. 14 (1980), 221–242.

    Article  MATH  MathSciNet  Google Scholar 

  8. Galil, Z., and Naamad, A. AnO(EV log2 V) algorithm for the maximal flow problem.J. Comput. System Sci. 21 (1980), 203–217.

    Article  MATH  MathSciNet  Google Scholar 

  9. Gallo, G., Grigoriades, M., and Tarjan, R. A fast parametric minimum cut algorithm. Technical Report LCSR-TR-95, Department of Computer Science, Rutgers University, New Brunswick, NJ, November 1986.

    Google Scholar 

  10. Gusfield, D., Martel, C. U., and Fernández-Baca, D. Fast algorithms for bipartite network flow.SIAM J. Comput. 16 (1987), 237–251.

    Article  MATH  MathSciNet  Google Scholar 

  11. Goldberg, A. V. Dfficient Algorithms for Sequential and Parallel Computers. Ph.D. Dissertation, EECSS Department, Massachusetts Institute of Technology, Cambridge, MA, January 1987.

    Google Scholar 

  12. Goldberg, A. V., and Tarjan, R. E. A new approach to the maximum flow problem.Proceedings of the 18th Annual ACM Symposium on Theory of Computing, 1986, pp. 136–146.

  13. Karzanov, A. V. Determining the maximal flow in a network by the method of preflows.Soviet Math. Dokl. 15 (1974), 434–437.

    MATH  Google Scholar 

  14. Martel, C. U. A Comparison of Phase and Non-Phase Network Flow Algorithms. Technical Report CSE-87-7, Computer Science Division, University of California, Davis, CA, June 1987.

    Google Scholar 

  15. Malhotra, V., Pramod Kumar, M., and Maheshwari, S. AnO(¦V¦3) algorithm for finding maximum flows in networks.Inform. Process. Lett. 7 (1978), 277–278.

    Article  MATH  MathSciNet  Google Scholar 

  16. Papadimitriou, C. H., and Steiglitz, K.Combinatorial Optimization: Algorithms and Complexity. Prentice-Hall, Englewood Cliffs, NJ, 1982.

    MATH  Google Scholar 

  17. Picard, J., and Queyranne, M. Selected Applications of Minimum Cuts in Networks.INFOR 20 (1982), 394–422.

    MATH  Google Scholar 

  18. Picard, J., and Queyranne, M. A network flow solution to some non-linear 0-1 programming problems with applications to graph theory.Networks 12 (1982), 141–159.

    Article  MATH  MathSciNet  Google Scholar 

  19. Sleator, D. D., and Tarjan, R. E. A data structure for dynamic trees.J. Comput. System Sci. 26 (1983), 362–391.

    Article  MATH  MathSciNet  Google Scholar 

  20. Tarjan, R. E.Data Structures and Network Algorithms. Society for Industrial and Applied Mathematics, Philadelphia, PA, 1983.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Iowa State University, 50011, Ames, IA, USA

    David Fernández-Baca

  2. Computer Science Division, University of California, 95616, Davis, CA, USA

    Charles U. Martel

Authors
  1. David Fernández-Baca
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Charles U. Martel
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Communicated by Nimrod Megiddo.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Fernández-Baca, D., Martel, C.U. On the efficiency of maximum-flow algorithms on networks with small integer capacities. Algorithmica 4, 173–189 (1989). https://doi.org/10.1007/BF01553885

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01553885

Key words

Search

Navigation