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/.
Original language | English (US) |
---|---|
Pages (from-to) | 165-182 |
Number of pages | 18 |
Journal | Journal of Graph Algorithms and Applications |
Volume | 9 |
Issue number | 1 |
DOIs | |
State | Published - 2005 |
ASJC Scopus subject areas
- Theoretical Computer Science
- General Computer Science
- Computer Science Applications
- Geometry and Topology
- Computational Theory and Mathematics