Simultaneous graph drawing: Layout algorithms and visualization schemes

C. Erten, S. G. Kobourov, V. Le, A. Navabi

Research output: Contribution to journalArticle

26 Scopus citations

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 languageEnglish (US)
Pages (from-to)165-182
Number of pages18
JournalJournal of Graph Algorithms and Applications
Volume9
Issue number1
DOIs
StatePublished - 2005

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)
  • Computer Science Applications
  • Geometry and Topology
  • Computational Theory and Mathematics

Fingerprint Dive into the research topics of 'Simultaneous graph drawing: Layout algorithms and visualization schemes'. Together they form a unique fingerprint.

  • Cite this