{'fraction_non_alphanumeric': 0.015521064301552107, 'fraction_numerical': 0.0, 'mean_word_length': 5.277777777777778, '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}}
Determination of All Minimal Cut-Sets between a Vertex Pair in an Undirected Graph

An efficient enumeration algorithm generates all minimal cut-sets separating a special vertex pair in an undirected graph. The algorithm is based on a blocking mechanism that guarantees that every minimal cut-set between the two specified vertices is generated exactly once. The algorithm is intended for computer implementation, and computational times are provided.