Blar i Department of Informatics på emneord "graph theory"
Viser treff 1-1 av 1
-
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 ...