CLUSTERING SU GRAFO

M. Maravalle

Abstract


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.


Keywords


Clustering

Full Text:

PDF

Refbacks

  • There are currently no refbacks.


Copyright (c) 1992 Franco Eugeni

Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.

Ratio Mathematica - Journal of Mathematics, Statistics, and Applications. ISSN 1592-7415; e-ISSN 2282-8214.