In networks, not all nodes have the same importance, and some are more important than
others. The issue of finding the most important nodes in networks has been addressed …

The-vertex cut (-VC) problem belongs to the family of the critical node detection problems,
which aims to find a minimum subset of vertices whose removal decomposes a graph into at …

The polyhedron defined by all the split cuts obtainable directly (ie without iterated cut
generation) from the LP-relaxation P of a mixed integer program (MIP) is termed the …

We consider 3-partitioning the vertices of a graph into sets S_1, S_2, and S_3 of specified
cardinalities, such that the total weight of all edges joining S_1 and S_2 is minimized. This …

In this paper, we address the following probabilistic version (PSC) of the set covering
problem:\min {cx\,|\mathbb P (Ax ≥ ξ) ≥ p, x ∈ {0, 1\}^ N\} where A is a 0-1 matrix, ξ is a …

The vertex separator (VS) problem in a graph G=(V, E) asks for a partition of V into nonempty
subsets A, B, C such that there is no edge between A and B, and| C| is minimized subject to …

We study the two most common types of percolation processes on a sparse random graph
with a given degree sequence. Namely, we examine first a bond percolation process where …

The family of critical node detection problems asks for finding a subset of vertices, deletion of
which minimizes or maximizes a predefined connectivity measure on the remaining network …

An effective way to analyze and apprehend the structural properties of networks is to find
their most critical nodes. This makes them easier to control, whether the purpose is to keep …

In graph theory, the problem of finding minimum vertex separator (MVS) is a classic NP-hard
problem, and it plays a key role in a number of important applications in practice. The real …