{'fraction_non_alphanumeric': 0.025435073627844713, 'fraction_numerical': 0.0, 'mean_word_length': 4.62406015037594, '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}}
Maximal independent sets in grid graphs

A grid graph is the Cartesian product of two path graphs. Enumerating all maximal independent sets in a graph is a well-known combinatorial problem. For a general graph, it is #P − complete. In this work, we provide a polynomial-time algorithm to generate the whole family of maximal independent sets (mis) of complete grid graphs with two rows. The same algorithm is used in two particular cases: chordless paths and cycles. We apply this result to characterize the independent graph (intersection graph of maximal independent sets) of these three classes of graphs. We also present an alternative proof of Euler’s result for grid graphs with three rows that can be used for enumerating the family of mis.