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:
COCOA (2015)
Keyphrases
</>
lower bound
upper bound
neural network
optimization problems
case study
bayesian networks
objective function
optimal solution
data structure
multi objective
mathematical programming
problems involving