Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics

Christian Komusiewicz, André Nichterlein, Rolf Niedermeier

In graph modification problems, one is given a graph G and the goal is to apply a minimum number of modification operations (such as edge deletions) to G such that the resulting gr…