Computational method for the point cluster analysis on networks

We present a general framework of hierarchical methods for point cluster analysis on networks, and then consider individual clustering procedures and their time complexities defined by typical variants of distances between clusters. The distances considered here are the closest-pair distance, the farthest-pair distance, the average distance, the median-pair distance and the radius distance. This paper will offer a menu for users to choose hierarchical clustering algorithms on networks from a time complexity point of view.