https://hal-enac.archives-ouvertes.fr/hal-00934806Cafieri, SoniaSoniaCafieriMAIAA - ENAC - Laboratoire de Mathématiques Appliquées, Informatique et Automatique pour l'Aérien - ENAC - Ecole Nationale de l'Aviation CivileHansen, PierrePierreHansenHEC Montréal - HEC MontréalModularity clustering on treesHAL CCSD2012clusteringtreenetworkmodularity maximizationdynamic programming[MATH.MATH-OC] Mathematics [math]/Optimization and Control [math.OC]Porte, Laurence2014-04-08 15:56:512021-10-19 11:02:482014-04-08 15:57:52enConference papersapplication/pdf1Network (or graphs) are often used to represent complex systems in a variety of fields. Tipically, the set of vertices of the graph corresponds to the set of entities under study and the edges represent relations holding for pairs of vertices. The analysis of networks is so gaining more and more attention, specially the analysis devoted to the detection of clusters, or communities. Clusters correspond in fact to subgroups of entities among which strong relations exist. In this paper we are particularly interested in clustering problems in which the underlying graph is a tree T = (V,E). Trees are undirected graphs in which any two vertices are connected by exactly one simple path. Clustering on trees [3] arises in a variety of applications, such as phylogenetic analysis in biological classification and the analysis of communication or distribution networks which exibit a tree-like structure.