The Maximum Flows in Planar Dynamic Networks

Authors

  • 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

Keywords:

network flow, planar network, dynamic network, maximum flow

Abstract

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.

References

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. http://dx.doi.org/10.1137/0216064

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. http://dx.doi.org/10.1016/0020-0190(81)90120-4

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. http://dx.doi.org/10.1137/0208012

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. http://dx.doi.org/10.1007/BF01240733

Published

2016-01-26

Most read articles by the same author(s)

Obs.: This plugin requires at least one statistics/report plugin to be enabled. If your statistics plugins provide more than one metric then please also select a main metric on the admin's site settings page and/or on the journal manager's settings pages.