Blar i Department of Informatics på emneord "vertex cover"
Viser treff 1-2 av 2
-
FPT Algorithms for Diverse Collections of Hitting Sets
(Peer reviewed; Journal article, 2019-11-27)In this work, we study the d-Hitting Set and Feedback Vertex Set problems through the paradigm of finding diverse collections of r solutions of size at most k each, which has recently been introduced to the field of ... -
Kernelization of Vertex Cover by Structural Parameters
(Master thesis, 2015-08-03)In the NP-complete problem Vertex Cover, one is given a graph G and an integer k and are asked whether there exists a vertex set S ⊆ V (G) with size at most k such that every edge of the graph is incident to a vertex in ...