By Topic

Optimally Invulnerable Directed Communication Networks

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 $13
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

2 Author(s)
J. Ayoub ; COMSAT Lab., Clarksburg ; I. Frisch

Algorithms are given to synthesize optimally invulnerable directed graphs with an arbitrary number of vertices and a minimum number of branches. We give a decomposition of these graphs into a class of subgraphs called step- l cycles, of which a directed Hamilton cycle is a special case. The use of this property in simultaneous k commodity flows is demonstrated.

Published in:

IEEE Transactions on Communication Technology  (Volume:18 ,  Issue: 5 )