Simultaneous graph drawing

layout algorithms and visualization schemes

Cesim Erten, Stephen G Kobourov, Vu Le, Armand Navabi

Research output: Contribution to journalArticle

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

Original languageEnglish (US)
Pages (from-to)437-449
Number of pages13
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2912
StatePublished - 2004

Fingerprint

Drawing (graphics)
Graph Drawing
Layout
Visualization
Weights and Measures
Graph in graph theory
Vertex of a graph
Preservation
Java
Series
Drawing

ASJC Scopus subject areas

  • Computer Science(all)
  • Biochemistry, Genetics and Molecular Biology(all)
  • Theoretical Computer Science

Cite this

@article{a4456052ef5f42c2b98cdbc16979ce89,
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 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/.",
author = "Cesim Erten and Kobourov, {Stephen G} and Vu Le and Armand Navabi",
year = "2004",
language = "English (US)",
volume = "2912",
pages = "437--449",
journal = "Lecture Notes in Computer Science",
issn = "0302-9743",
publisher = "Springer Verlag",

}

TY - JOUR

T1 - Simultaneous graph drawing

T2 - layout algorithms and visualization schemes

AU - Erten, Cesim

AU - Kobourov, Stephen G

AU - Le, Vu

AU - Navabi, Armand

PY - 2004

Y1 - 2004

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

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

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

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

M3 - Article

VL - 2912

SP - 437

EP - 449

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

SN - 0302-9743

ER -