{'fraction_non_alphanumeric': 0.021653543307086614, 'fraction_numerical': 0.007874015748031496, 'mean_word_length': 5.5256410256410255, '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}}
Two-way circuit partitioning by iterative improvement and logic perturbation

In this paper, we present five algorithms that simultaneously consider both the graph domain and logic domain for two-way min-cut circuit partitioning, To handle both domains, the iterative improvement and logic perturbation techniques are employed. The experimental results show that our algorithms are capable of generating better or comparable partitioning results as compared to the algorithm presented by Cheng et al. (1995).