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 vertex set. We designed and implemented three different algorithms for simultaneous graph drawing and three different visualization schemes. The algorithms are based on a modification of the force-directed algorithm that allows us to take into account vertex weights and edge weights in order to achieve mental map preservation while obtaining individually readable drawings. The implementation is in Java and the system can be downloaded at http://simg.cs.arizona.edu/. © Springer-Verlag 2004.
CITATION STYLE
Erten, C., Kobourov, S. G., Le, V., & Navabi, A. (2004). Simultaneous graph drawing: layout algorithms and visualization schemes. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2912, 437–449. https://doi.org/10.1007/978-3-540-24595-7_41
Mendeley helps you to discover research relevant for your work.