Finding the optimal variable ordering for binary decision diagrams
DAC '87 Proceedings of the 24th ACM/IEEE Design Automation Conference
Symbolic Boolean manipulation with ordered binary-decision diagrams
ACM Computing Surveys (CSUR)
A decomposition algorithm for network reliability evaluation
Discrete Applied Mathematics - Special volume: first international colloquium on graphs and optimization (GOI), 1992
CAREL: Computer Aided Reliability Evaluator for Distributed Computing Networks
IEEE Transactions on Parallel and Distributed Systems
Analyzing Network Reliability With Imperfect Nodes Using OBDD
PRDC '02 Proceedings of the 2002 Pacific Rim International Symposium on Dependable Computing
Using Multi-valued Decision Diagrams to Solve the Expected Hop Count Problem
WAINA '09 Proceedings of the 2009 International Conference on Advanced Information Networking and Applications Workshops
Comparison of binary and multi-variate hybrid decision diagram algorithms for k-terminal reliability
ACSC '11 Proceedings of the Thirty-Fourth Australasian Computer Science Conference - Volume 113
| Hi-index | 0.00 |
We combine the Augmented Ordered Binary Decision Diagram (OBDD-A) with the use of boundary sets to create a method for computing the exact K-terminal or allterminal reliability of an undirected network with failed edges and perfect vertices. We present the results of implementing this algorithm and show that the execution time is comparable with the state of the art and the space requirement is greatly reduced. Indeed the space remains constant when networks increase in size but maintain their structure and maximum boundary set size; with the same amount of memory used for computing a 3×12 and a 3×1000 grid network.