Drawing dynamic graphs without timeslices

Paolo Simonetto, Daniel Archambault, Stephen Kobourov

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

10 Scopus citations


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
EditorsKwan-Liu Ma, Fabrizio Frati
Number of pages16
ISBN (Print)9783319739144
StatePublished - 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


Other25th International Symposium on Graph Drawing and Network Visualization, GD 2017
Country/TerritoryUnited States

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)


Dive into the research topics of 'Drawing dynamic graphs without timeslices'. Together they form a unique fingerprint.

Cite this