品質學報 · 2009 · 13 citations · 22 references
ComputingComputer ScienceSystems EngineeringComputer NetworksFault-tolerant ComputingFault-tolerant SystemsDependability AnalysisGraph AlgorithmsNetwork AnalysisNetwork ReliabilityReliability ModelingReliable System DesignCommunication Network ReliabilityGraph DecompositionsNetwork DecompositionNetwork Reliability AlgorithmsNetwork Reliability AnalysisPolygon ReductionRandom FailuresSystem Reliability Analysis
The evaluation of complex systems reliability is a crucial test to secure operations and infrastructure against failures. This paper presents the network decomposition method and compares some results to solve network reliability problem. The algorithm proceeds recursively according to the factoring theorem in conjunction with simplification and polygon-to-chain reduction rules and considers the case where network components-vertices and edges could fail randomly. The implementation of the algorithm is efficient and proceeds in less time comparing with the best examples found in the literature.
22
Graph-Based Algorithms for Boolean Function Manipulation
Bryant · IEEE Transactions on Computers · 1986 · 8.9K citations · Full text
Depth-First Search and Linear Graph Algorithms
Robert E. Tarjan · SIAM Journal on Computing · 1972 · 6K citations
Efficient implementation of a BDD package
Karl S. Brace, Richard Rudell, Randal E. Bryant · 1990 · 1.1K citations · Full text
An Improved Algorithm for Network Reliability
Jessie Abraham · IEEE Transactions on Reliability · 1979 · 392 citations