Browsing Department of Informatics by Subject "Randomized Algorithms"
Now showing items 1-1 of 1
(Conference object; Peer reviewed; Journal article, 2015)Let F be a family of graphs. Given an input graph G and a positive integer k, testing whether G has a k-sized subset of vertices S, such that G\S belongs to F, is a prototype vertex deletion problem. These type of problems ...