{'fraction_non_alphanumeric': 0.010893246187363835, 'fraction_numerical': 0.0, 'mean_word_length': 5.133333333333334, '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}}
Heuristic Graph Bisection with Less Restrictive Balance Constraints

Fast graph partitioning is an important subproblem in many applications. While the classical problem asks all partitions to be of almost the same size, there are some applications that do not need or even do not want such restrictive constraints. This paper shows how the Helpful-Set heuristic implemented in the graph partitioning library Party can be adopted to the less restrictive case.