By Topic

Efficient algorithms for reliability analysis of planar networks - a survey

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
$31 $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)
Politof, Themistocles ; Concordia University, Montreal ; Satyanarayana, A.

We survey some recent polynomial-time algorithms for the exact computation of network reliability. The algorithms apply to several classes of planar networks, which include series-parallel, inner-cycle-free, inner-four-cycle-free and planar cube-free. We describe these classes and discuss the related polynomial algorithms for computing their reliability.

Published in:

Reliability, IEEE Transactions on  (Volume:35 ,  Issue: 3 )