Simultaneous graph drawing: Layout algorithms and visualization schemes

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

Research output: Contribution to journalArticle

24 Citations (Scopus)

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
StatePublished - 2005

Fingerprint

Drawing (graphics)
Graph Drawing
Layout
Visualization
Graph in graph theory
Vertex of a graph
Preservation
Series

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science
  • Computer Science(all)
  • Computer Science Applications

Cite this

Simultaneous graph drawing : Layout algorithms and visualization schemes. / Erten, C.; Kobourov, Stephen G; Le, V.; Navabi, A.

In: Journal of Graph Algorithms and Applications, Vol. 9, No. 1, 2005, p. 165-182.

Research output: Contribution to journalArticle

@article{f84a3355ffa94492b6a7bb0daf3d5bc5,
title = "Simultaneous graph drawing: Layout algorithms and visualization schemes",
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/.",
author = "C. Erten and Kobourov, {Stephen G} and V. Le and A. Navabi",
year = "2005",
language = "English (US)",
volume = "9",
pages = "165--182",
journal = "Journal of Graph Algorithms and Applications",
issn = "1526-1719",
publisher = "Brown University",
number = "1",

}

TY - JOUR

T1 - Simultaneous graph drawing

T2 - Layout algorithms and visualization schemes

AU - Erten, C.

AU - Kobourov, Stephen G

AU - Le, V.

AU - Navabi, A.

PY - 2005

Y1 - 2005

N2 - 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/.

AB - 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/.

UR - http://www.scopus.com/inward/record.url?scp=27744472075&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=27744472075&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:27744472075

VL - 9

SP - 165

EP - 182

JO - Journal of Graph Algorithms and Applications

JF - Journal of Graph Algorithms and Applications

SN - 1526-1719

IS - 1

ER -