The whole frame of interconnections in complex networks hinges on a specific set of
structural nodes, much smaller than the total size, which, if activated, would cause the …

The integrity and functionality of many real-world complex systems hinge on a small set of
pivotal nodes, or influencers. In different contexts, these influencers are defined as either …

We study the network dismantling problem, which consists of determining a minimal set of
vertices in which removal leaves the network broken into connected components of …

Decycling and dismantling of complex networks are underlying many important applications
in network science. Recently these two closely related problems were tackled by several …

For a network formed by nodes and undirected links between pairs of nodes, the network
optimal attack problem aims at deleting a minimum number of target nodes to break the …

In social and biological systems, the structural heterogeneity of interaction networks gives
rise to the emergence of a small set of influential nodes, or influencers, in a series of …

The effective use of limited resources for controlling spreading processes on networks is of
prime significance in diverse contexts, ranging from the identification of “influential …

In many social and biological networks, the collective dynamics of the entire system can be
shaped by a small set of influential units through a global cascading process, manifested by …

The K-core of a graph is the unique maximum subgraph within which each vertex connects
to K or more other vertices. The optimal K-core attack problem asks to delete the minimum …

We consider the following activation process in undirected graphs: a vertex is active either if
it belongs to a set of initially activated vertices or if at some point it has at least r active …