The Maximum Flows in Planar Dynamic Networks

Camelia Schiopu, Eleonor Ciurea


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.


network flow, planar network, dynamic network, maximum flow

Full Text:



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

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

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

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

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

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

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.

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

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.

Khuller,S.; Naor,J. (1994); Flows in planar graphs with vertex capacities, Algorithmica, 11: 200-225.


Copyright (c) 2017 Camelia Schiopu, Eleonor Ciurea

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

CC-BY-NC  License for Website User

Articles published in IJCCC user license are protected by copyright.

Users can access, download, copy, translate the IJCCC articles for non-commercial purposes provided that users, but cannot redistribute, display or adapt:

  • Cite the article using an appropriate bibliographic citation: author(s), article title, journal, volume, issue, page numbers, year of publication, DOI, and the link to the definitive published version on IJCCC website;
  • Maintain the integrity of the IJCCC article;
  • Retain the copyright notices and links to these terms and conditions so it is clear to other users what can and what cannot be done with the  article;
  • Ensure that, for any content in the IJCCC article that is identified as belonging to a third party, any re-use complies with the copyright policies of that third party;
  • Any translations must prominently display the statement: "This is an unofficial translation of an article that appeared in IJCCC. Agora University  has not endorsed this translation."

This is a non commercial license where the use of published articles for commercial purposes is forbiden. 

Commercial purposes include: 

  • Copying or downloading IJCCC articles, or linking to such postings, for further redistribution, sale or licensing, for a fee;
  • Copying, downloading or posting by a site or service that incorporates advertising with such content;
  • The inclusion or incorporation of article content in other works or services (other than normal quotations with an appropriate citation) that is then available for sale or licensing, for a fee;
  • Use of IJCCC articles or article content (other than normal quotations with appropriate citation) by for-profit organizations for promotional purposes, whether for a fee or otherwise;
  • Use for the purposes of monetary reward by means of sale, resale, license, loan, transfer or other form of commercial exploitation;

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

[End of CC-BY-NC  License for Website User]

INTERNATIONAL JOURNAL OF COMPUTERS COMMUNICATIONS & CONTROL (IJCCC), With Emphasis on the Integration of Three Technologies (C & C & C),  ISSN 1841-9836.

IJCCC was founded in 2006,  at Agora University, by  Ioan DZITAC (Editor-in-Chief),  Florin Gheorghe FILIP (Editor-in-Chief), and  Misu-Jan MANOLESCU (Managing Editor).

Ethics: This journal is a member of, and subscribes to the principles of, the Committee on Publication Ethics (COPE).

Ioan  DZITAC (Editor-in-Chief) at COPE European Seminar, Bruxelles, 2015:

IJCCC is covered/indexed/abstracted in Science Citation Index Expanded (since vol.1(S),  2006); JCR2018: IF=1.585..

IJCCC is indexed in Scopus from 2008 (CiteScore2018 = 1.56):

Nomination by Elsevier for Journal Excellence Award Romania 2015 (SNIP2014 = 1.029): Elsevier/ Scopus

IJCCC was nominated by Elsevier for Journal Excellence Award - "Scopus Awards Romania 2015" (SNIP2014 = 1.029).

IJCCC is in Top 3 of 157 Romanian journals indexed by Scopus (in all fields) and No.1 in Computer Science field by Elsevier/ Scopus.


 Impact Factor in JCR2018 (Clarivate Analytics/SCI Expanded/ISI Web of Science): IF=1.585 (Q3). Scopus: CiteScore2018=1.56 (Q2);

SCImago Journal & Country Rank

Editors-in-Chief: Ioan DZITAC & Florin Gheorghe FILIP.