Uniform resource networks I. Complete graphs
Author:
- 18 November 2009
- journal article
- Published by Pleiades Publishing Ltd in Automation and Remote Control
- Vol. 70 (11) , 1889-1900
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.Keywords
This publication has 1 reference indexed in Scilit:
- Network Flows: Theory, Algorithms, and Applications.Journal of the Operational Research Society, 1994