114 citations · 229 across the 12 of their papers we have counts for
1 paper · 1 filter
Shao-Meng Qin
C-dismantling (CD) problem aims at finding the minimum vertex set D of a graph G(V,E) after removing which the remaining graph will break into connected components with the size no…