• Graph Adhesion

Graph Adhesion

The minimal sum of edge weights of removed edges, to get a resulting graph which is not strongly connected. That means, two nodes exist, which are not connected by a path.