Label algorithm for the Maximum Flow problem

Authors

  • Rósulo Perez Cupe Facultad de Ciencias, Universidad Nacional de Ingeniería, Lima - Perú

DOI:

https://doi.org/10.21754/tecnia.v12i1.509

Abstract

Presently work is studied the theorem of the flow maximum-cut minimum (L. Ford and D..
Fulkerson) from the practical poin of view, this is its demonstration is based on the test of correctude of the algorithm of labels. The implementation of such an algorithm is also presented.

Downloads

Download data is not yet available.

References

[1] . R. K. Ahuja, T. L. Magnanti, J. B. Orlin, Network Flows Theory Algorithms and Aplications. Prentice Hall, 1993.

[2] . Rósulo Pérez Cupe, Algoritmos Polinomiales para el problema del flujo máximo. Tesis de Licenciatura, 2001.

[3]. T. H. Cormen, C. E. Leiserson, R. L. Rivest, Introduction to algorithms. MIT Press and McGraw-Hill, 1990.

Downloads

Published

2002-06-01

How to Cite

[1]
R. Perez Cupe, “Label algorithm for the Maximum Flow problem”, TECNIA, vol. 12, no. 1, Jun. 2002.

Issue

Vol. 12 No. 1 (2002)

Section

Articles

License

Copyright (c) 2002 TECNIA

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

Articles published by TECNIA can be shared under the international Creative Commons license: CC BY 4.0. Permissions beyond this scope can be inquired via email at tecnia@uni.edu.pe.