Network-based dissolution

We introduce a novel graph-theoretic dissolution model which applies to a number of redistribution scenarios such as gerrymandering or work economization. The central aspect of our model is to delete some vertices and redistribute their "load" to neighboring vertices in a completely balanced way. We investigate how the underlying graph structure, the pre-knowledge about which vertices to delete, and the relation between old and new "vertex load" influence the computational complexity of the underlying easy-to-describe graph problems, thereby identifying both tractable and intractable cases

CLUSTERING SU GRAFO

The present paper deals with the following problem: given a connected graph G with n nodes, partition its set of nodee into p classes such that the subgraph induced by each class is connected and given function, inertia; of the partition is minimized This paper includes : a heuristic algorithm for general graphs based on the solution of a sequence of restricted problems where G is replaced by one of its spanning tree ; a complete set of real-life applications and a comparison with a hiernrchical algorithm

CLUSTERING SU GRAFO

The present paper deals with the following problem: given a connected graph G with n nodes, partition its set of nodee into p classes such that the subgraph induced by each class is connected and given function, inertia; of the partition is minimized This paper includes : a heuristic algorithm forgeneral graphs based on the solution of a sequence of restricted problems where G is replaced by one of its spanning tree ; a complete set of real-life applications and a comparison with a hiernrchical algorithm

CLUSTERING CON MASSIMA SEPARAZIONE SU UN ALBERO

missin