Blar i Faculty of Mathematics and Natural Sciences på emneord "modification"
Viser treff 1-1 av 1
-
Exploring Subexponential Parameterized Complexity of Completion Problems
(Peer reviewed; Journal article, 2014-02-19)Let F be a family of graphs. In the F-Completion problem, we are given an n-vertex graph G and an integer k as input, and asked whether at most k edges can be added to G so that the resulting graph does not contain a graph ...