Vertex Separation in Networks

We study the problems of finding a subset of nodes having a given size $k$ and satisfying one of the following separation properties: The set is disconnected from the rest of the graph by a small/large cut or by a small separator. The considered problems are of interest in several practical settings, such as epidemiology or disaster control as well as to contrast viruses, malware, or mi...