Simultaneous Graph Drawing: Layout Algorithms and Visualization Schemes

In this paper we consider the problem of drawing and displaying a series of related graphs, i.e., graphs that share all, or parts of the same node set. We present three algorithms for simultaneous graph drawing and three visualization schemes. The algorithms are based on a modification of the force-directed algorithm that allows us to take into account node weights and edge weights in order to achieve mental map preservation while obtaining individually readable drawings. The algorithms and visualization schemes have been implemented and the system can be downloaded at http://simg.cs.arizona.edu/. Article Type Communicated by Submitted Revised regular paper G. Liotta February 2004 July 2005 This work is partially supported by the NSF under grant ACR-0222920. ded abstract of this paper appeared in GD 2003. 

• Type: Conference
• Year: 2003
• Where: GD
• Authors: Cesim Erten, Stephen G. Kobourov, Vu Le, Armand Navabi
• Keywords: Algorithms, GD 2003, Simultaneous Graph Drawing, Visualization Schemes