Variable neighborhood search for partitioning sparse biological networks into the maximum edge-weighted $k$-plexes

Milana Grbić, Aleksandar Kartelj, Savka Janković +2

In a network, a $k$-plex represents a subset of $n$ vertices where the degree of each vertex in the subnetwork induced by this subset is at least $n-k$. The maximum edge-weight $k$…