On the flow peculiarity in network with barrier reachability
Abstract
The problem of finding maximal flow in networks with barrier reachability is considered. It is shown that existing algorithm for solution this problem can't find solution for all networks. New algorithm is suggested.
References
1. Ерусалимский Я.М., Скороходов В.А. Потоки в сетях со связанными дугами./Я.М.Ерусалимский, В.А.Скороходов.//Изв. вузов. Сев.-Кав. регион. Естественные науки, 2003; прил. № 8. -С. 9-12.
2. Edmonds Jack, Karp Richard M. Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems.//Journal of the Association for Computing Machinery. -Vol. 19. -No. 2, April 1972, -P. 248-264.
3. Ning Xuanxi, Ning Angelika The Blocking Flow Theory and its Application to Hamiltonian Graph Problems. Germany,Aachen: Shaker Verlag GmbH, 2006. -249p.
Review
For citations:
VODOLAZOV N. On the flow peculiarity in network with barrier reachability. Vestnik of Don State Technical University. 2008;8(2):127-136. (In Russ.)
Views:
278
Email this article 