Login / Signup
A faster FPT algorithm for 3-path vertex cover.
Ján Katrenic
Published in:
Inf. Process. Lett. (2016)
Keyphrases
</>
vertex cover
learning algorithm
np hard
computational complexity
objective function
optimal solution
search space
dynamic programming
worst case
expectation maximization
theoretical analysis
parameter estimation
graph structure