Measure & Conquer is an approach helpful for designing branching algorithms. A key point in the approach is how to design the measure. Given a graph and an integer k, the Bounded Degree-one Deletion problem asks for if there exists a subset D of at most k vertices such that the degree of any vertex in is upper bounded by one. Combining the parameter with a potential as the measure in Measure & Conquer, where the potential is a lower bound of the decrement of the parameter, we design a branching algorithm running in polynomial space and time, which improves the current best parameterized complexity of the problem.