Simultaneous graph drawing: layout algorithms and visualization schemes

Cesim Erten; Stephen G. Kobourov; Vu Le; Armand Navabi

doi:10.1007/978-3-540-24595-7_41

Simultaneous graph drawing: layout algorithms and visualization schemes

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

Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Chapter

31 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 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 language	English (US)
Title of host publication	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Editors	Giuseppe Liotta
Publisher	Springer-Verlag
Pages	437-449
Number of pages	13
ISBN (Print)	3540208313, 9783540208310
DOIs	https://doi.org/10.1007/978-3-540-24595-7_41
State	Published - 2004

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	2912
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-540-24595-7_41

Cite this

Erten, C., Kobourov, S. G., Le, V., & Navabi, A. (2004). Simultaneous graph drawing: layout algorithms and visualization schemes. In G. Liotta (Ed.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (pp. 437-449). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2912). Springer-Verlag. https://doi.org/10.1007/978-3-540-24595-7_41

Simultaneous graph drawing: layout algorithms and visualization schemes. / Erten, Cesim; Kobourov, Stephen G.; Le, Vu et al.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). ed. / Giuseppe Liotta. Springer-Verlag, 2004. p. 437-449 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2912).

Research output: Chapter in Book/Report/Conference proceeding › Chapter

Erten, C, Kobourov, SG, Le, V & Navabi, A 2004, Simultaneous graph drawing: layout algorithms and visualization schemes. in G Liotta (ed.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2912, Springer-Verlag, pp. 437-449. https://doi.org/10.1007/978-3-540-24595-7_41

Erten C, Kobourov SG, Le V, Navabi A. Simultaneous graph drawing: layout algorithms and visualization schemes. In Liotta G, editor, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer-Verlag. 2004. p. 437-449. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-540-24595-7_41

Erten, Cesim ; Kobourov, Stephen G. ; Le, Vu et al. / 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). editor / Giuseppe Liotta. Springer-Verlag, 2004. pp. 437-449 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inbook{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",

doi = "10.1007/978-3-540-24595-7_41",

language = "English (US)",

isbn = "3540208313",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer-Verlag",

pages = "437--449",

editor = "Giuseppe Liotta",

booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - CHAP

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

U2 - 10.1007/978-3-540-24595-7_41

DO - 10.1007/978-3-540-24595-7_41

M3 - Chapter

AN - SCOPUS:4544226922

SN - 3540208313

SN - 9783540208310

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 437

EP - 449

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

A2 - Liotta, Giuseppe

PB - Springer-Verlag

ER -

Simultaneous graph drawing: layout algorithms and visualization schemes

Abstract

Publication series

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this