In the Maximum Degree Contraction problem, input is a graph G on n vertices, and integers k, d, objective to check whether can be transformed into of maximum degree at most using k edge contractions. A simple brute-force algorithm that checks all possible sets edges for solution runs in time $$n^{\mathcal {O}(k)}$$ . As our first result, we prove this asymptotically optimal, upto constants expo...
