{'fraction_non_alphanumeric': 0.020887728459530026, 'fraction_numerical': 0.0, 'mean_word_length': 4.485714285714286, '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}}
Even cycles and H-Homeomorphisms

The aim of this paper is to describe a polynomial-time reduction of the Even Cycle Problem to the H-Homeomorphism Problem. As a consequence, we present a polynomial-time algorithm to solve the Even Cycle Problem in any class of digraphs which may be drawn on a fixed but arbitrary surface. The same results hold for more general modularity problems.