{'fraction_non_alphanumeric': 0.019417475728155338, 'fraction_numerical': 0.0, 'mean_word_length': 5.3538461538461535, '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}}
Revisiting a Pattern for Processing Combinatorial Objects in Parallel

The unrank pattern to process combinatorial objects in parallel is revisited. The pattern is applied to find, in parallel, solutions to a restricted version of the community finding problem on small graphs. Performance results obtained on a shared memory machine, a cluster of workstations and a Graphical Processing Unit (GPU) are included.