By Topic

Using the Decomposition Tree for Directed-Network Reliability Computation

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

1 Author(s)
Hagstrom, Jane N. ; Dept. of Quantitative Methods; University of Illinois; POBox 4348; Chicago, Illinois 60680 USA.

A related paper provides an algorithm to compute the reliability of an undirected network. The algorithm exploits the decomposition tree of the network derived from decomposing the network graph into its triconnected components. This paper extends the algorithm to apply to reliability problems involving directed networks. Details are presented which specialize the algorithm to apply to the problems of 2-terminal communication, transportation flow feasibility, and path-length feasibility.

Published in:

Reliability, IEEE Transactions on  (Volume:R-33 ,  Issue: 5 )