The problem of finding the maximum multiple flow in the divisible network and its special cases-Reference-Cited by-同舟云学术

The problem of finding the maximum multiple flow in the divisible network and its special cases

Published:2016-12 Issue:7 Volume:50 Page:527-535
ISSN:0146-4116
Container-title:Automatic Control and Computer Sciences
language:en
Short-container-title:Aut. Control Comp. Sci.

Author:

Smirnov A. V.

Publisher

Allerton Press

Subject

Signal Processing,Control and Systems Engineering,Software

Link

http://link.springer.com/content/pdf/10.3103/S0146411616070191.pdf

Reference20 articles.

1. Rublev, V.S. and Smirnov, A.V., Flows in multiple networks, Yarosl. Pedagog. Vestn., 2011, vol. 3, no. 2, pp. 60–68.

2. Ford, L.R. and Fulkerson, D.R., Flows in Networks, Princeton University Press, 1962.

3. Papadimitriou, Ch.H. and Steigliz, K., Combinatorial Optimization: Algorithms and Complexity, Prentice Hall, 1982.

4. Roublev, V.S. and Smirnov, A.V., The problem of integer-valued balancing of a three-dimensional matrix and algorithms of its solution, Model. Anal. Inf. Syst., 2010, vol. 17, no. 2, pp. 72–98.

5. Smirnov, A.V., Some solvability classes for the problem of integer balancing of a three-dimensional matrix with constraints of second type, Model. Anal. Inf. Syst., 2013, vol, 20, no. 2, pp. 54–69.

Cited by 9 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Some polynomial subclasses of the Eulerian walk problem for a multiple graph;Modeling and Analysis of Information Systems;2024-09-13

2. NP-completeness of the Eulerian walk problem for a multiple graph;Modeling and Analysis of Information Systems;2024-03-28

3. The Polynomial Algorithm of Finding the Shortest Path in a Divisible Multiple Graph;Automatic Control and Computer Sciences;2023-12

4. The algorithms for the Eulerian cycle and Eulerian trail problems for a multiple graph;Modeling and Analysis of Information Systems;2023-09-17

5. The Polynomial Algorithm of Finding the Shortest Path in a Divisible Multiple Graph;Modeling and Analysis of Information Systems;2022-12-18