Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Kocer, Onur"'
Let $H$ be a fixed undirected graph on $k$ vertices. The $H$-hitting set problem asks for deleting a minimum number of vertices from a given graph $G$ in such a way that the resulting graph has no copies of $H$ as a subgraph. This problem is a specia
Externí odkaz:
http://arxiv.org/abs/2011.14450
