{'fraction_non_alphanumeric': 0.011023622047244094, 'fraction_numerical': 0.0, 'mean_word_length': 5.989010989010989, '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}}
On Solving Multimessage Multicasting Problems

In this paper we survey algorithms and complexity results for the multimessage multicasting problem and its variations under a unified notation. The main results apply to the multimessage multicasting problem for complete networks and pr-networks (multistage interconnection networks that can realize all permutations in one communication phase and replicate data on each switch). We also discuss algorithms that allow message forwarding and distributed algorithms where each processor only knows local information. Different applications where this problem naturally arises are explored.