Improved algorithm for 2-club cluster vertex deletion

2-club cluster graph modification problems are classical NP-hard problems. The parameterized algorithms were studied for the 2-club cluster graph modification problems, and several reduction rules were presented to reduce the size of input instance. Based on the structure analysis of the 2-club cluster graph and the reduction rules presented, by applying a top-down approach, a fixed-parameterized algorithm with running time O*(3.24k) was presented, which improves the current algorithm solving the 2-club cluster graph modification problems.