Abstract: A k-vertex cut problem aims to find a minimum subset of nodes whose removal decomposes a graph into at least k connected components, which belongs to the family of critical node detection ...