Blar i Faculty of Mathematics and Natural Sciences på tidsskrift "ACM Transactions on Algorithms (TALG)"
Viser treff 1-1 av 1
-
Subquadratic Kernels for Implicit 3-Hitting Set and 3-Set Packing Problems
(Peer reviewed; Journal article, 2019)We consider four well-studied NP-complete packing/covering problems on graphs: Feedback Vertex Set in Tournaments (FVST), Cluster Vertex Deletion (CVD), Triangle Packing in Tournaments (TPT) and Induced P3-Packing. For ...