A genetic approach to hierarchical clustering of Euclidean graphs

We propose an encoding scheme and ad hoc operators for a generic approach to graph clustering. Given a connected graph whose vertices correspond to points within a Euclidean space and a fitness function, a hierarchy of graphs in which each vertex corresponds to a connected subgraph of the graph below is generated. Both the number of clustering levels and the number of clusters on each level are subject to optimization.