Laure Morelle, Bounded size modifications in time $2^{{\sf poly}(k)}\cdot n^2$
Room B332 IBS (기초과학연구원)A replacement action is a function $\mathcal L$ that maps each graph to a collection of subgraphs of smaller size. Given a graph class $\mathcal H$, we consider a general family of graph modification problems, called "$\mathcal L$-Replacement to $\mathcal H$", where the input is a graph $G$ and the question is whether it is …