The Maximum Flows in Planar Dynamic Networks

  • Camelia Schiopu Transilvania University of Brasov Romania, 500091 Braşov, Iuliu Maniu, 50
  • Eleonor Ciurea Transilvania University of Brasov Romania, 500091 Braşov, Iuliu Maniu, 50


An nontrivial extension of the maximal static flow problem is the maximal dynamic flow model, where the transit time to traverse an arc is taken into consideration. If the network parameters as capacities, arc traversal times, and so on, are constant over time, then a dynamic flow problem is said to be stationary. Research on flow in planar static network is motivated by the fact that more efficient algorithms can be developed by exploiting the planar structure of the graph. This article states and solves the maximum flow in directed (1, n) planar dynamic networks in the stationary case.


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

[2] Cai,X.; Sha,D.; Wong,C. (2007); Time-varying Network Optimization, Editing Springer.

[3] Ciurea,E. (1984); Les problemes des flots dynamiques, Cahiers du CERO, 26(1-2): 3-9.

[4] Frederickson,G. (1987); Fast algorithms for shortest path in planar graphs, with applications, SIAM Journal on Computing, 16: 1004-1022.

[5] Ford,L.; Fulkerson,D. (1962); Flows in Networks, Princeton University Press, Princeton, N.J.

[6] Hassin,R. (1981); Maximum flows in (s, t) planar networks, Information Processing letters, 13: 107.

[7] Hassin,R.; Johnson,D. (1985); An O(n log2 n) algorithm for maximum flow in undirected planar networks, SIAM Journal on Computing, 14: 612-624.

[8] Itai, A.; Shiloach, Y. (1979); Maximum flow in planar networks, SIAM Journal on Computing, 8: 135-150.

[9] Johnson, D.; Venkatesan,S. (1982); Using divide and conquer to find flows in directed planar networks in O(n1.5 log n) time, Proceedings of the 20th Annual Allerton Conference on Communication , Control and Computing, University of Illinois, Urbana-Champaign, IL., 898-905.

[10] Khuller,S.; Naor,J. (1994); Flows in planar graphs with vertex capacities, Algorithmica, 11: 200-225.
How to Cite
SCHIOPU, Camelia; CIUREA, Eleonor. The Maximum Flows in Planar Dynamic Networks. INTERNATIONAL JOURNAL OF COMPUTERS COMMUNICATIONS & CONTROL, [S.l.], v. 11, n. 2, p. 282-291, jan. 2016. ISSN 1841-9844. Available at: <>. Date accessed: 19 jan. 2021. doi:


network flow, planar network, dynamic network, maximum flow