No Cover Image

Conference Paper/Proceeding/Abstract 1197 views 208 downloads

Drawing Dynamic Graphs Without Timeslices

Paolo Simonetto, Daniel Archambault Orcid Logo, Stephen Kobourov

Lecture Notes in Computer Science, Volume: 10692, Pages: 394 - 409

Swansea University Author: Daniel Archambault Orcid Logo

Check full text

DOI (Published version): 10.1007/978-3-319-73915-1_31

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

Full description

Published in: Lecture Notes in Computer Science
ISBN: 9783319739144 9783319739151
ISSN: 0302-9743 1611-3349
Published: Cham Springer International Publishing 2018
Online Access: Check full text

URI: https://cronfa.swan.ac.uk/Record/cronfa35081
Tags: Add Tag
No Tags, Be the first to tag this record!
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.
College: Faculty of Science and Engineering
Start Page: 394
End Page: 409

Similar Items