1.2k citations · 1.4k across the 9 of their papers we have counts for
1 paper · 1 filter
Xiao-Long Ren, Nino Antulov-Fantulin
Finding a set of nodes in a network, whose removal fragments the network below some target size at minimal cost is called network dismantling problem and it belongs to the NP-hard…