Zobrazeno 1 - 2
of 2
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
Autor:
Paola Flocchini, Lucia Moura
This book constitutes the proceedings of the 32nd International Workshop on Combinatorial Algorithms which was planned to take place in Ottawa, ON, Canada, in July 2021. Due to the COVID-19 pandemic the conference changed to a virtual format.The 38 f