zbMATH — the first resource for mathematics

Uniform resource networks. I: Complete graphs. (English. Russian original) Zbl 1187.90073
Autom. Remote Control 70, No. 11, 1889-1900 (2009); translation from Avtom. Telemekh. 2009, No. 11, 136-147 (2009).
Summary: A bidirectional resource network is a directed graph in which any two vertices \(\upsilon _i , \upsilon _j\) are either not adjacent or are connected by a pair of edges \((\upsilon _i , \upsilon _j ), (\upsilon _j , \upsilon _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.

90B10 Deterministic network models in operations research
05C90 Applications of graph theory
91B32 Resource and cost allocation (including fair division, apportionment, etc.)
Full Text: DOI
[1] 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. · Zbl 0106.34802
[2] Ahuja, R.K., Magnati, T.L., and Orlin, J.B., Network Flows: Theory, Algorithms and Applications, New Jersey: Prentice Hall, 1993.
[3] 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. · Zbl 1094.90511
[4] 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. · Zbl 1224.91013
[5] Feller, W., An Introduction to Probability Theory and Its Applications, New York: Wiley, 1968, vol. 1. · Zbl 0155.23101
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.