Login / Signup
On the Parameterized Complexity of \textsc{Maximum Degree Contraction} Problem.
Saket Saurabh
Prafullkumar Tale
Published in:
CoRR (2020)
Keyphrases
</>
parameterized complexity
global constraints
fixed parameter tractable
constraint programming
belief change
np hard