@inproceedings{03544c1ba9d84f2a9800ad06bda92686,

title = "Algorithms for the Minimum Edge Cover of H-Subgraphs of a Graph",

abstract = "We consider the following problem: given graph G and a set of graphs H = {H-1,...,H-i} what is the smallest subset S of edges in G such that all subgraphs of G that are isomorphic to one of the graphs from H contain at least one edge from S? Equivalently, we aim to find the minimum number of edges that needs to be removed from G to make it H-free. We concentrate on the case where all graphs H-i are connected and have fixed size. Several algorithmic results are presented. First, we derive a polynomial time dynamic program for the problem on graphs of bounded treewidth and bounded maximum vertex degree. Then, if H contains only a clique, we adjust the dynamic program to solve the problem on graphs of bounded treewidth having arbitrary maximum vertex degree. Using the constructed dynamic programs, we design a Baker's type approximation scheme for the problem on planar graphs. Finally, we observe that our results hold also if we cover only induced H-subgraphs.",

author = "A. Grigoriev and L. Marchal and N. Usotskaya",

year = "2010",

month = jan,

day = "1",

doi = "10.1007/978-3-642-11266-9_38",

language = "English",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

number = "5901",

pages = "452--464",

editor = "Leeuwen, {J. van}",

booktitle = "Theory and Practice of Computer Science",

address = "United States",

}