Journal of Graph Algorithms and Applications
|Home||Issues||Aims and Scope||Instructions for Authors|
Special Issue on Selected Papers from the Eleventh International Symposium on Graph Drawing, GD 2003
Simultaneous Graph Drawing: Layout Algorithms and Visualization Schemes
Vol. 9, no. 1, pp. 165-182, 2005. Regular paper.
Abstract 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/.
Submitted: February 2004.
Revised: July 2005.
Communicated by Giuseppe Liotta