Login / Signup
Parameterized lower bound and NP-completeness of some H-free Edge Deletion problems.
N. R. Aravind
R. B. Sandeep
Naveen Sivadasan
Published in:
CoRR (2015)
Keyphrases
</>
lower bound
problems involving
upper bound
solving problems
np complete
learning algorithm
image segmentation
similarity measure
objective function
edge information