Drawing dynamic graphs without timeslices

Paolo Simonetto, Daniel Archambault, Stephen G Kobourov

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

Timeslices are often used to draw and visualize dynamic graphs. While timeslices are a natural way to think about dynamic graphs, they are routinely imposed on continuous data. Often, it is unclear how many timeslices to select: too few timeslices can miss temporal features such as causality or even graph structure while too many timeslices slows the drawing computation. We present a model for dynamic graphs which is not based on timeslices, and a dynamic graph drawing algorithm, DynNoSlice, to draw graphs in this model. In our evaluation, we demonstrate the advantages of this approach over timeslicing on continuous data sets.

Original languageEnglish (US)
Title of host publicationGraph Drawing and Network Visualization - 25th International Symposium, GD 2017, Revised Selected Papers
PublisherSpringer-Verlag
Pages394-409
Number of pages16
ISBN (Print)9783319739144
DOIs
StatePublished - Jan 1 2018
Event25th International Symposium on Graph Drawing and Network Visualization, GD 2017 - Boston, United States
Duration: Sep 25 2017Sep 27 2017

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume10692 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other25th International Symposium on Graph Drawing and Network Visualization, GD 2017
CountryUnited States
CityBoston
Period9/25/179/27/17

Fingerprint

Dynamic Graphs
Graph Drawing
Graph in graph theory
Causality
Drawing
Evaluation
Model
Demonstrate

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Simonetto, P., Archambault, D., & Kobourov, S. G. (2018). Drawing dynamic graphs without timeslices. In Graph Drawing and Network Visualization - 25th International Symposium, GD 2017, Revised Selected Papers (pp. 394-409). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10692 LNCS). Springer-Verlag. https://doi.org/10.1007/978-3-319-73915-1_31

Drawing dynamic graphs without timeslices. / Simonetto, Paolo; Archambault, Daniel; Kobourov, Stephen G.

Graph Drawing and Network Visualization - 25th International Symposium, GD 2017, Revised Selected Papers. Springer-Verlag, 2018. p. 394-409 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10692 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Simonetto, P, Archambault, D & Kobourov, SG 2018, Drawing dynamic graphs without timeslices. in Graph Drawing and Network Visualization - 25th International Symposium, GD 2017, Revised Selected Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 10692 LNCS, Springer-Verlag, pp. 394-409, 25th International Symposium on Graph Drawing and Network Visualization, GD 2017, Boston, United States, 9/25/17. https://doi.org/10.1007/978-3-319-73915-1_31
Simonetto P, Archambault D, Kobourov SG. Drawing dynamic graphs without timeslices. In Graph Drawing and Network Visualization - 25th International Symposium, GD 2017, Revised Selected Papers. Springer-Verlag. 2018. p. 394-409. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-319-73915-1_31
Simonetto, Paolo ; Archambault, Daniel ; Kobourov, Stephen G. / Drawing dynamic graphs without timeslices. Graph Drawing and Network Visualization - 25th International Symposium, GD 2017, Revised Selected Papers. Springer-Verlag, 2018. pp. 394-409 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{c6101ab3266340d6804801429f1d5d84,
title = "Drawing dynamic graphs without timeslices",
abstract = "Timeslices are often used to draw and visualize dynamic graphs. While timeslices are a natural way to think about dynamic graphs, they are routinely imposed on continuous data. Often, it is unclear how many timeslices to select: too few timeslices can miss temporal features such as causality or even graph structure while too many timeslices slows the drawing computation. We present a model for dynamic graphs which is not based on timeslices, and a dynamic graph drawing algorithm, DynNoSlice, to draw graphs in this model. In our evaluation, we demonstrate the advantages of this approach over timeslicing on continuous data sets.",
author = "Paolo Simonetto and Daniel Archambault and Kobourov, {Stephen G}",
year = "2018",
month = "1",
day = "1",
doi = "10.1007/978-3-319-73915-1_31",
language = "English (US)",
isbn = "9783319739144",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer-Verlag",
pages = "394--409",
booktitle = "Graph Drawing and Network Visualization - 25th International Symposium, GD 2017, Revised Selected Papers",

}

TY - GEN

T1 - Drawing dynamic graphs without timeslices

AU - Simonetto, Paolo

AU - Archambault, Daniel

AU - Kobourov, Stephen G

PY - 2018/1/1

Y1 - 2018/1/1

N2 - Timeslices are often used to draw and visualize dynamic graphs. While timeslices are a natural way to think about dynamic graphs, they are routinely imposed on continuous data. Often, it is unclear how many timeslices to select: too few timeslices can miss temporal features such as causality or even graph structure while too many timeslices slows the drawing computation. We present a model for dynamic graphs which is not based on timeslices, and a dynamic graph drawing algorithm, DynNoSlice, to draw graphs in this model. In our evaluation, we demonstrate the advantages of this approach over timeslicing on continuous data sets.

AB - Timeslices are often used to draw and visualize dynamic graphs. While timeslices are a natural way to think about dynamic graphs, they are routinely imposed on continuous data. Often, it is unclear how many timeslices to select: too few timeslices can miss temporal features such as causality or even graph structure while too many timeslices slows the drawing computation. We present a model for dynamic graphs which is not based on timeslices, and a dynamic graph drawing algorithm, DynNoSlice, to draw graphs in this model. In our evaluation, we demonstrate the advantages of this approach over timeslicing on continuous data sets.

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

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

U2 - 10.1007/978-3-319-73915-1_31

DO - 10.1007/978-3-319-73915-1_31

M3 - Conference contribution

SN - 9783319739144

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

SP - 394

EP - 409

BT - Graph Drawing and Network Visualization - 25th International Symposium, GD 2017, Revised Selected Papers

PB - Springer-Verlag

ER -