{'fraction_non_alphanumeric': 0.011848341232227487, 'fraction_numerical': 0.0, 'mean_word_length': 4.716216216216216, '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}}
Parametric Network Flows

This paper considers a directed capacitated network in which the supply at each source node and the demand at each sink node is a linear function of a parameter t. It presents two algorithms that determine the range of values for the parameter t; they correspond to the primal and dual linear-programming algorithms that solve this problem. The dual algorithm appears to have a simpler structure.