Affiliations: [a] Department of Mathematics and Computer Science, Transilvania University of Braşov, 50 Iuliu Maniu, Braşov, 500091, Romania. [email protected] | [b] Department of Mathematics and Computer Science, Transilvania University of Braşov, 50 Iuliu Maniu, Braşov, 500091, Romania. [email protected]
Correspondence:
[*]
Address for correspondence: Transilvania University of Braşov, Department of Mathematics and Computer Science, 50 Iuliu Maniu, Braşov, 500091, Romania.
Abstract: This article states and solves the maximum flow in directed (1, n) planar dynamic networks with lower bounds. We present the case when the planar dynamic network is stationary. Finally, we present an example for this problem.
Keywords: maximum flow, planar network, dynamic network, lower bounds
