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 g...
Main Author: | |
---|---|
Format: | Article |
Language: | English |
Published: |
Accademia Piceno Aprutina dei Velati
1992-04-01
|
Series: | Ratio Mathematica |
Subjects: | |
Online Access: | http://eiris.it/ojs/index.php/ratiomathematica/article/view/226 |