Two Flow Problems in Dynamic Networks

  • Camelia Schiopu Transilvania University of Brasov Romania, 500091 Brasov, Iului Maniu, 50
  • Eleonor Ciurea Transilvania University of Brasov Romania, 500091 Brasov, Iului Maniu, 50

Abstract

In this paper we study two flow problems: the feasible flow problem in dynamic networks and the maximum flow problem in bipartite dynamic networks with lower bounds. We mention that the maximum flow problem in bipartite dynamic networks with lower bound was presented in paper [8]a. For these problems we give examples.

References

[1] R. Ahuja, T. Magnanti and J. Orlin (1993), Network Flows. Theory, algorithms and applications, Prentice Hall, Inc., Englewood Cliffs, New Jersey, 1993.

[2] R. Ahuja, J. Orlin, C. Stein and R. Tarjan (1994), Improved algorithms for bipartite network flows, SIAM Journal of Computing, 23:906-933.
https://doi.org/10.1137/S0097539791199334

[3] X. Cai, D. Sha and C. Wong (2007), Time-varying Nework Optimization, Springer, 2007.

[4] E. Ciurea (2002), Second best temporally repeated flow, Korean Journal of Computational and Applied Mathematics, 9(1):77-86.

[5] L. Ford, D. Fulkerson, Flow in Networks., Princeton University Press, Princenton, New Jersey, 1962.

[6] D. Gusfield, C. Martel, and D. Fernandez-Baca (1987), Fast algorithms for bipartite network flow, SIAM Journal of Computing, 16:237-251.
https://doi.org/10.1137/0216020

[7] C. Schiopu, E. Ciurea (2016), The maximum flows in planar dynamic dynamic networks, International Journal of Computers Communications & Control, 11(2):282-291.
https://doi.org/10.15837/ijccc.2016.2.2444

[8] C. Schiopu, E. Ciurea, The maximum flows in bipartite dynamic networks with lower bounds. The static approach, Computers Communications and Control (ICCCC), 2016 6th International Conference on, IEEE Xplore, e-ISSN 978-1-5090-1735-5, doi: 10.1109/ICCCC. 2016.7496731, 10-15.
Published
2016-12-02
How to Cite
SCHIOPU, Camelia; CIUREA, Eleonor. Two Flow Problems in Dynamic Networks. INTERNATIONAL JOURNAL OF COMPUTERS COMMUNICATIONS & CONTROL, [S.l.], v. 12, n. 1, p. 103-115, dec. 2016. ISSN 1841-9844. Available at: <http://univagora.ro/jour/index.php/ijccc/article/view/2786>. Date accessed: 27 june 2022.
Citation Formats
Issue
Vol 12 No 1 (2017): International Journal of Computers Communications & Control (February)
Section
Articles

Keywords

dynamic networks, feasible flow, bipartite network, maximum flow
Creative Commons License

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

ONLINE OPEN ACCES: Acces to full text of each article and each issue are allowed for free in respect of Attribution-NonCommercial 4.0 International (CC BY-NC 4.0.

You are free to:

-Share: copy and redistribute the material in any medium or format;

-Adapt: remix, transform, and build upon the material.

The licensor cannot revoke these freedoms as long as you follow the license terms.

 

DISCLAIMER: The author(s) of each article appearing in International Journal of Computers Communications & Control is/are solely responsible for the content thereof; the publication of an article shall not constitute or be deemed to constitute any representation by the Editors or Agora University Press that the data presented therein are original, correct or sufficient to support the conclusions reached or that the experiment design or methodology is adequate.