Graph partitioning using matrix differential equations

Eleonora Andreotti, Dominik Edelmann, Nicola Guglielmi +1

Given a connected undirected weighted graph, we are concerned with problems related to partitioning the graph. First of all we look for the closest disconnected graph (the minimum…