{'fraction_non_alphanumeric': 0.014072119613016711, 'fraction_numerical': 0.002638522427440633, 'mean_word_length': 4.896373056994818, '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}}
Efficient generation of minimal graphs using independent path analysis

Determination of the minimal crossing number of a complete graph is an NPcomplete problem that has been attacked in various ways over the years with limited success. Much previous work has focused on conjectured solutions that have been verified only for small values of n, where n is the number of vertices in the graph’s vertex set. The advent of more powerful computers and the ability to network multiple computers into Beowolf clusters have led to renewed interest in exact solutions to crossing number problems. In this thesis, we introduce a new method for finding the minimal crossing number of complete graphs. Our algorithm lays down new edges independent of each other to create minimal Kn graphs from minimal Kn−1 graphs, a technique we have entitled Star Analysis. We validate our algorithm on small complete Kn graphs, then demonstrate its efficiency in generating larger minimal Kn graphs up to n = 11. Finally, we extend our process to the generation of minimal Km,n bipartite graphs to document its usefulness in a variety of graph family problems.