Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Minimum cost flows over time without intermediate storage
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Asymmetrical resource networks. I. Stabilization processes for low resources
Automation and Remote Control
Asymmetric resource networks. II. Flows for large resources and their stabilization
Automation and Remote Control
Control of limit states in absorbing resource networks
Automation and Remote Control
| Hi-index | 0.01 |
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.