CLUSTERING SU GRAFO

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...

Full description

Bibliographic Details
Main Author: M. Maravalle
Format: Article
Language:English
Published: Accademia Piceno Aprutina dei Velati 1992-04-01
Series:Ratio Mathematica
Subjects:
Clustering
Online Access:http://eiris.it/ojs/index.php/ratiomathematica/article/view/226
id doaj-0b50e57c5f804c9298d96bf3b7a1092e
record_format Article
spelling doaj-0b50e57c5f804c9298d96bf3b7a1092e2020-11-24T22:50:15ZengAccademia Piceno Aprutina dei VelatiRatio Mathematica1592-74152282-82141992-04-0141125144232CLUSTERING SU GRAFOM. Maravalle0Facoltà di Economia e Commercio Universutà degli Studi dell'AquilaThe 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.http://eiris.it/ojs/index.php/ratiomathematica/article/view/226Clustering
collection DOAJ
language English
format Article
sources DOAJ
author M. Maravalle
spellingShingle M. Maravalle
CLUSTERING SU GRAFO
Ratio Mathematica
Clustering
author_facet M. Maravalle
author_sort M. Maravalle
title CLUSTERING SU GRAFO
title_short CLUSTERING SU GRAFO
title_full CLUSTERING SU GRAFO
title_fullStr CLUSTERING SU GRAFO
title_full_unstemmed CLUSTERING SU GRAFO
title_sort clustering su grafo
publisher Accademia Piceno Aprutina dei Velati
series Ratio Mathematica
issn 1592-7415
2282-8214
publishDate 1992-04-01
description 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.
topic Clustering
url http://eiris.it/ojs/index.php/ratiomathematica/article/view/226
work_keys_str_mv AT mmaravalle clusteringsugrafo
_version_ 1725673257806331904

Similar Items