This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
11th International Conference Information Visualization (IV '07)
How to Draw ClusteredWeighted Graphs using a Multilevel Force-Directed Graph Drawing Algorithm
Zurich, Switzerland
July 04-July 06
ISBN: 0-7695-2900-3
Romain Bourqui, LaBRI, Universite Bordeaux I, France
David Auber, LaBRI, Universite Bordeaux I, France
Patrick Mary, LaBRI, Universite Bordeaux I, France
Visualization of clustered graphs has been a research area since many years. In this paper, we describe a new approach that can be used in real application where graph does not contain only topological information but also extrinsic parameters (i.e. user attributes on edges and nodes). In the case of force-directed algorithm, management of attributes corresponds to take into account edge weights. We propose an extension of the GRIP algorithm in order to manage edge weights. Furthermore, by using Voronoi diagram we constrained that algorithm to draw each cluster in a non overlapping convex region. Using these two extensions we obtained an algorithm that draw clustered weighted graphs. Experimentation has been done on data coming from biology where the network is the genesproteins interaction graph and where the attributes are gene expression values from microarray experiments.
Citation:
Romain Bourqui, David Auber, Patrick Mary, "How to Draw ClusteredWeighted Graphs using a Multilevel Force-Directed Graph Drawing Algorithm," iv, pp.757-764, 11th International Conference Information Visualization (IV '07), 2007
Usage of this product signifies your acceptance of the Terms of Use.