CLUSTERING SU GRAFO

Authors

  • M. Maravalle Facoltà di Economia e Commercio Universutà degli Studi dell'Aquila

Keywords:

Clustering

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.

Downloads

Issue

Vol. 4 (1992)

Section

Volume 4-1992

License

This journal provides immediate open access to its content on the principle that making research freely available to the public supports a greater global exchange of knowledge. The journal is committed to real and immediate open access for academic work. All of the journal articles are free to access immediately from the date of publication. There are no charge for readers to download articles and reviews for their own scholarly use. Benefits of open access for authors, include:

  • Free access for all users worldwide
  • Increased visibility and readership
  • Rapid publication
  • No spatial constraints
  • Authors can share their research papers on their personal web-pages (i.e. ResearchGate, etc.)

Ratio Mathematica publishes open access articles under the terms of the Creative Commons Attribution (CC BY) License. The Creative Commons Attribution License (CC-BY) allows users to copy, distribute and transmit an article, adapt the article and make commercial use of the article. The CC BY license permits commercial and non-commercial re-use of an open access article, as long as the author is properly attributed. Copyright on any research article published by Ratio Mathematica is retained by the author(s). Authors grant Ratio Mathematica a license to publish the article and identify itself as the original publisher. Authors also grant any third party the right to use the article freely as long as its original authors, citation details and publisher are identified. 
For further information visit: https://creativecommons.org/licenses/by/3.0/. The following logo will appear in any paper that will be published from the volume number 31/2016 onwards.