{'fraction_non_alphanumeric': 0.02018348623853211, 'fraction_numerical': 0.003669724770642202, 'mean_word_length': 4.515151515151516, '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}}
ON CONSTRUCTING THREE EDGE INDEPENDENT SPANNING TREES

Abstract. In this paper, we show that a prior result by Khuller and Schieber on the construction of k edge independent spanning trees in a k edge-connected graph fails under certain scenarios. We illustrate the failing of the algorithm with an example and identify the cause, which we refer to as the partial order inversion. For the case of k = 3, we develop a method to compute three edge independent spanning trees in three edge connected graphs with a running time complexity of O(V 2).