Abstract
A bidirectional resource network is a directed graph in which any two vertices υ i , υ j are either not adjacent or are connected by a pair of edges (υ i , υ j ), (υ j , υ i ). Non-negative numbers (resources) are assigned to vertices. The rules of functioning for such networks are formulated and processes of resource distribution in bidirectional networks represented by complete graphs are considered. It is shown that limit states of such networks do not depend on initial resource distributions.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Ford, L.R. and Fulkerson, D.R., Flows in Networks, Princeton: Princeton Univ. Press, 1962. Translated under the title Potoki v setyakh, Moscow: Mir, 1966.
Ahuja, R.K., Magnati, T.L., and Orlin, J.B., Network Flows: Theory, Algorithms and Applications, New Jersey: Prentice Hall, 1993.
Fleischer, L. and Skutella, M., Minimum Cost Flows Over Time without Intermediate Storage, Proc. 35th ACM/SIAM Symp. Discrete Algorithms (SODA), 2003, pp. 66–75.
Erzin, A.I. and Takhonov, I.I., The Problem of Finding a Balanced Flow, Sib. Zh. Industr. Mat., 2006, vol. 9, no. 4 (28), pp. 50–63.
Feller, W., An Introduction to Probability Theory and Its Applications, New York: Wiley, 1968, vol. 1.
Author information
Authors and Affiliations
Additional information
Original Russian Text © O.P. Kuznetsov, 2009, published in Avtomatika i Telemekhanika, 2009, No. 11, pp. 136–147.
Rights and permissions
About this article
Cite this article
Kuznetsov, O.P. Uniform resource networks I. Complete graphs. Autom Remote Control 70, 1889–1900 (2009). https://doi.org/10.1134/S0005117909110137
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0005117909110137