{'fraction_non_alphanumeric': 0.0367170626349892, 'fraction_numerical': 0.0, 'mean_word_length': 4.830188679245283, '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}}
Playing with Parameters: Cross-parameterization in Graphs

When considering a graph problem from a parameterized point of view, the parameter chosen is often the size of an optimal solution of this problem (the "standard"). A natural subject for investigation is what happens when we parameterize such a problem by the size of an optimal solution of a different problem. We provide a framework for doing such analysis. In particular, we investigate seven natural vertex problems, along with their respective parameters: α (the size of a maximum independent set), τ (the size of a minimum vertex cover), ω (the size of a maximum clique), χ (the chromatic number), γ (the size of a minimum dominating set), i (the size of a minimum independent dominating set) and ν (the size of a minimum feedback vertex set). We study the parameterized complexity of each of these problems with respect to the standard parameter of the others.