Geodesic
Flows in generalized nets with related arcs
Modelirovanie i analiz informacionnyh sistem, Tome 19 (2012) no. 2, pp. 41-52.

Voir la notice de l'article provenant de la source Math-Net.Ru

The problem of finding the maximum flow in nets of a special form is considered. In such nets the arcs are related in such a way that the total flow passing through the related arcs does not exceed the minimum throughput of these arcs. It is shown that the theorem by Ford and Fulkerson, according to which the maximum flux value is equal to the throughput of a minimum cut, is not performed for such networks. The estimations of the maximum flow in a generalized net with bound arcs are proposed. And the algorithm for finding the maximum flow in such nets is developed.
Keywords: graph, graph algorithms, reachability, nonstandard reachability, flows on nets. 
@article{MAIS_2012_19_2_a2,
     author = {V. A. Skorokhodov},
     title = {Flows in generalized nets with related arcs},
     journal = {Modelirovanie i analiz informacionnyh sistem},
     pages = {41--52},
     publisher = {mathdoc},
     volume = {19},
     number = {2},
     year = {2012},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/MAIS_2012_19_2_a2/}
}
TY  - JOUR
AU  - V. A. Skorokhodov
TI  - Flows in generalized nets with related arcs
JO  - Modelirovanie i analiz informacionnyh sistem
PY  - 2012
SP  - 41
EP  - 52
VL  - 19
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/MAIS_2012_19_2_a2/
LA  - ru
ID  - MAIS_2012_19_2_a2
ER  - 
%0 Journal Article
%A V. A. Skorokhodov
%T Flows in generalized nets with related arcs
%J Modelirovanie i analiz informacionnyh sistem
%D 2012
%P 41-52
%V 19
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/MAIS_2012_19_2_a2/
%G ru
%F MAIS_2012_19_2_a2
V. A. Skorokhodov. Flows in generalized nets with related arcs. Modelirovanie i analiz informacionnyh sistem, Tome 19 (2012) no. 2, pp. 41-52. http://geodesic.mathdoc.fr/item/MAIS_2012_19_2_a2/

[1] Ya. M. Erusalimskii, V. A. Skorokhodov, “Potoki v setyakh so svyazannymi dugami”, Izvestiya VUZov. Severo-Kavkazskii region. Estestvennye nauki. Prilozhenie, 2003, no. 8, 3–8 | Zbl

[2] Ya. M. Erusalimskii, Diskretnaya matematika: teoriya, zadachi, prilozheniya, Vuzovskaya kniga, M., 2001, 279 pp.

[3] K. Berzh, Teoriya grafov i ee primeneniya, Izd–vo inostrannoi literatury, M., 1962, 319 pp.

[4] A. Kofman, Vvedenie v prikladnuyu kombinatoriku, Nauka, M., 1975, 480 pp. | MR

[5] Ya. M. Erusalimskii, V. A. Skorokhodov, “Grafy s ventilnoi dostizhimostyu. Markovskie protsessy i potoki v setyakh”, Izvestiya VUZov. Severo-Kavkazskii region. Estestvennye nauki, 2003, no. 2, 3–5

[6] Ya. M. Erusalimskii, V. A. Skorokhodov, “Pribyl ot potokov s obratnoi svyazyu v orsetyakh s ogranicheniyami na dostizhimost”, Izvestiya VUZov. Severo-Kavkazskii region. Estestvennye nauki. Prilozhenie, 2003, no. 8, 9–12 | Zbl