By Topic

Proper flow paths in vertex-weighted communication nets

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $33
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
B. R. Myers ; University of Oxford, Department of Engineering Science, Oxford, UK ; B. R. Myers ; E. A. Davila

In a communication net in which the maximum attainable flows are determined by the vertex capacities, there is, in general, a high degree of redundancy among the paths available for flow assignments in the net. A technique is given by which the set of all nonredundant paths, called proper flow paths, is uniquely determined. The method employs a direct and simple means of eliminating the redundancies in a pathfinding routine proposed previously by Paz, involving symbolic noncommutative multiplications among the entries of a modified vertex-adjacency matrix. A useful byproduct ensues with the immediate identification of vertexes which are not in any vertex cut set. This simplifies the problem of identifying all vertex cut sets in the net. A presentation of proper-flow-path theory in communication nets is included in the paper.

Published in:

Electrical Engineers, Proceedings of the Institution of  (Volume:115 ,  Issue: 3 )