{'fraction_non_alphanumeric': 0.01779935275080906, 'fraction_numerical': 0.0, 'mean_word_length': 4.627272727272727, '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}}
Toward an efficient, highly scalable maximum clique solver for massive graphs

As the size of available data sets grows, so too does the demand for efficient parallel algorithms that will yield the solution to complex combinatorial problems on graphs that may be too large to fit entirely in memory. In previous work, we have provided a set of out-of-core algorithms to solve one of the central examples of such a problem, maximum clique. In this paper, we review the algorithms and report on our ongoing work to use them as a starting point for an optimized, highly scalable implementation of a maximum clique solver.