|
This article is cited in 9 scientific papers (total in 9 papers)
The maximal flow problem on networks with special conditions of flow distribution
V. A. Skorokhodov, A. S. Chebotareva Southern Federal University, 8a Milchakova St., 344090 Rostov-on-Don, Russia
Abstract:
We consider the problem of finding the maximal flow in nets with conditions of strict and nonstrict flow distribution. We show that for each condition of flow distribution the solution of the considered problem exists and is unique. The algorithms for finding the maximal flow are developed for each condition of flow distribution. We find bounds on the maximal flow value in the case of strict flow distribution. Ill. 3, tab. 4, bibliogr. 11.
Keywords:
network, graph, graph algorithm, maximal flow on network, flow distribution.
Received: 16.06.2014 Revised: 25.03.2015
Citation:
V. A. Skorokhodov, A. S. Chebotareva, “The maximal flow problem on networks with special conditions of flow distribution”, Diskretn. Anal. Issled. Oper., 22:3 (2015), 55–74; J. Appl. Industr. Math., 9:3 (2015), 435–446
Linking options:
https://www.mathnet.ru/eng/da819 https://www.mathnet.ru/eng/da/v22/i3/p55
|
Statistics & downloads: |
Abstract page: | 242 | Full-text PDF : | 263 | References: | 43 | First page: | 9 |
|