{'fraction_non_alphanumeric': 0.014613778705636743, 'fraction_numerical': 0.0, 'mean_word_length': 4.925925925925926, '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}}
A fast minimum cost flow algorithm for VLSI layout compaction

Since the layout compaction problem is dual to the minimum cost flow problem, flow algorithms can be applicable to the layout compaction. In this paper, an existing flow algorithm is investigated in terms of the layout compaction, and a fast flow algorithm is devised on the basis of the primal-dual method. Experimental results show that the proposed algorithm is the fastest dedicatedly for the compaction problem.