Identifying sets of key players in a network

Two problems are considered: finding a set of nodes that is maximally connected to all other nodes (KPP-Pos), and finding a set of nodes whose removal would result in a residual network of minimum cohesion. The problems are solved by the introduction of connectedness and fragmentation metrics, which are incorporated in a combinatorial optimization procedure.