By Topic

Fast Layout Computation of Hierarchically Clustered Networks: Algorithmic Advances and Experimental Analysis

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Didimo, W. ; Dipt. di Ing. Elettron. e dell''Inf., Univ. degli Studi di Perugia, Perugia, Italy ; Montecchiani, F.

Fast computation of two-dimensional layouts of hierarchically clustered networks is a well-studied problem in graph visualization. We present algorithmic and experimental advances on the subject: (i) We propose a new drawing algorithm that combines space-filling and fast force-directed methods; it runs in O(nlogn+m) time, where n and m are the number of vertices and edges of the network, respectively. This running time does not depend on the number of clusters, thus the algorithm guarantees good time performances independently of the structure of the cluster hierarchy. As a further advantage, the algorithm can be easily parallelized. (ii) We present an experimental analysis aimed at understanding which clustering algorithms can be used, in combination with our visualization technique, to generate better quality drawings for medium and large networks with small-world and scale-free structure. As far as we know, no previous similar experiments have been done in this respect.

Published in:

Information Visualisation (IV), 2012 16th International Conference on

Date of Conference:

11-13 July 2012