GO: a cluster algorithm for graph visualization

Xiaodi Huang, Weidong Huang

Research output: Contribution to journalArticlepeer-review

6 Citations (Scopus)


As we are in the big data age, graph data such as user networks in Facebook and Flickr becomes large. How to reduce the visual complexity of a graph layout is a challenging problem. Clustering graphs is regarded as one of effective ways to address this problem. Most of current graph visualization systems, however, directly use existing clustering algorithms that are not originally developed for the visualization purpose. For graph visualization, a clustering algorithm should meet specific requirements such as the sufficient size of clusters, and automatic determination of the number of clusters. After identifying the requirements of clustering graphs for visualization, in this paper we present a new clustering algorithm that is particularly designed for visualization so as to reduce the visual complexity of a layout, together with a strategy for improving the scalability of our algorithm. Experiments have demonstrated that our proposed algorithm is capable of detecting clusters in a way that is required in graph visualization.
Original languageEnglish
Pages (from-to)71-82
Number of pages12
JournalJournal of Visual Languages and Computing
Publication statusPublished - Jun 2015


Dive into the research topics of 'GO: a cluster algorithm for graph visualization'. Together they form a unique fingerprint.

Cite this