Method of elimination of a group of unknown flows in networks with the generalized kirchhoff law

Flows are considered in networks for which the difference of incoming a fid outgoing flows for some node belongs to some interval. The interval depends on the consumption at the node. For this case, a method is developed to eliminate a group of unknown flows in a terminal or intermediate subgraph.

Saved in:
Bibliographic Details
Published in:Cybernetics and systems analysis 1999-11, Vol.35 (6), p.976-980
Main Author: Finin, G. S.
Format: Article
Language:English
Subjects:
Graph theory
Kirchhoff law
Citations: Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Flows are considered in networks for which the difference of incoming a fid outgoing flows for some node belongs to some interval. The interval depends on the consumption at the node. For this case, a method is developed to eliminate a group of unknown flows in a terminal or intermediate subgraph.
ISSN:1060-0396
1573-8337
DOI:10.1007/BF02742291