Review of the Path-based Algorithm on Network Reliability

The path-based algorithm is one of the important algorithms in computing the network reliability.The study shows that the evaluation of network reliability based on minimal path is a typical NP-hard problem.It includes three branches:inclusion-exclusion,sum of disjoint products and binary decision diagrams.This paper mainly reviews these three algorithms.Finally,this survey concludes these three algorithms and presents the prospects of network reliability.