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.
Get full access to this article
View all access options for this article.