Gives FPT algorithms for l-path vertex cover achieving bases 3.945, 4.947 and 5.951 for l=5,6,7.
A faster FPT algorithm for 3-path vertex cover
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
l-path vertex cover is easier than l-hitting set for small l
Gives FPT algorithms for l-path vertex cover achieving bases 3.945, 4.947 and 5.951 for l=5,6,7.