{'fraction_non_alphanumeric': 0.015681544028950542, 'fraction_numerical': 0.0, 'mean_word_length': 5.484375, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
A survey of efficient reliability computation using disjoint products approach

Several algorithms have been developed to solve the reliability problem for nonseries-parallel networks using the sum of disjoint products (SDP) approach. This paper provides a general framework for most of these techniques. It reviews methods that help improve computer time and memory requirements in reliability computation. These parameters are generally used to compare SDP algorithms. We also overview three multiple variable inversion algorithms that result in sum of disjoint products expressions with fewer terms than that of algorithms that use only a single-variable inversion. One common network is solved for two-terminal network reliability using each of these algorithms. Finally, we have provided a comparison among these techniques.