No Cover Image

Conference Paper/Proceeding/Abstract 957 views 180 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!
first_indexed 2017-09-03T18:53:33Z
last_indexed 2022-06-17T02:49:39Z
id cronfa35081
recordtype SURis
fullrecord <?xml version="1.0"?><rfc1807><datestamp>2022-06-16T15:46:44.2822894</datestamp><bib-version>v2</bib-version><id>35081</id><entry>2017-09-03</entry><title>Drawing Dynamic Graphs Without Timeslices</title><swanseaauthors><author><sid>8fa6987716a22304ef04d3c3d50ef266</sid><ORCID>0000-0003-4978-8479</ORCID><firstname>Daniel</firstname><surname>Archambault</surname><name>Daniel Archambault</name><active>true</active><ethesisStudent>false</ethesisStudent></author></swanseaauthors><date>2017-09-03</date><deptcode>SCS</deptcode><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.</abstract><type>Conference Paper/Proceeding/Abstract</type><journal>Lecture Notes in Computer Science</journal><volume>10692</volume><journalNumber/><paginationStart>394</paginationStart><paginationEnd>409</paginationEnd><publisher>Springer International Publishing</publisher><placeOfPublication>Cham</placeOfPublication><isbnPrint>9783319739144</isbnPrint><isbnElectronic>9783319739151</isbnElectronic><issnPrint>0302-9743</issnPrint><issnElectronic>1611-3349</issnElectronic><keywords/><publishedDay>21</publishedDay><publishedMonth>1</publishedMonth><publishedYear>2018</publishedYear><publishedDate>2018-01-21</publishedDate><doi>10.1007/978-3-319-73915-1_31</doi><url/><notes/><college>COLLEGE NANME</college><department>Computer Science</department><CollegeCode>COLLEGE CODE</CollegeCode><DepartmentCode>SCS</DepartmentCode><institution>Swansea University</institution><degreesponsorsfunders>This work was funded by EPSRC First Grant EP/N005724/1.</degreesponsorsfunders><apcterm/><lastEdited>2022-06-16T15:46:44.2822894</lastEdited><Created>2017-09-03T15:40:16.9474183</Created><path><level id="1">Faculty of Science and Engineering</level><level id="2">School of Mathematics and Computer Science - Computer Science</level></path><authors><author><firstname>Paolo</firstname><surname>Simonetto</surname><order>1</order></author><author><firstname>Daniel</firstname><surname>Archambault</surname><orcid>0000-0003-4978-8479</orcid><order>2</order></author><author><firstname>Stephen</firstname><surname>Kobourov</surname><order>3</order></author></authors><documents><document><filename>0035081-03092017154428.pdf</filename><originalFilename>dynoslice.pdf</originalFilename><uploaded>2017-09-03T15:44:28.8770000</uploaded><type>Output</type><contentLength>373761</contentLength><contentType>application/pdf</contentType><version>Accepted Manuscript</version><cronfaStatus>true</cronfaStatus><embargoDate>2018-09-03T00:00:00.0000000</embargoDate><copyrightCorrect>true</copyrightCorrect><language>eng</language></document></documents><OutputDurs/></rfc1807>
spelling 2022-06-16T15:46:44.2822894 v2 35081 2017-09-03 Drawing Dynamic Graphs Without Timeslices 8fa6987716a22304ef04d3c3d50ef266 0000-0003-4978-8479 Daniel Archambault Daniel Archambault true false 2017-09-03 SCS 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. Conference Paper/Proceeding/Abstract Lecture Notes in Computer Science 10692 394 409 Springer International Publishing Cham 9783319739144 9783319739151 0302-9743 1611-3349 21 1 2018 2018-01-21 10.1007/978-3-319-73915-1_31 COLLEGE NANME Computer Science COLLEGE CODE SCS Swansea University This work was funded by EPSRC First Grant EP/N005724/1. 2022-06-16T15:46:44.2822894 2017-09-03T15:40:16.9474183 Faculty of Science and Engineering School of Mathematics and Computer Science - Computer Science Paolo Simonetto 1 Daniel Archambault 0000-0003-4978-8479 2 Stephen Kobourov 3 0035081-03092017154428.pdf dynoslice.pdf 2017-09-03T15:44:28.8770000 Output 373761 application/pdf Accepted Manuscript true 2018-09-03T00:00:00.0000000 true eng
title Drawing Dynamic Graphs Without Timeslices
spellingShingle Drawing Dynamic Graphs Without Timeslices
Daniel Archambault
title_short Drawing Dynamic Graphs Without Timeslices
title_full Drawing Dynamic Graphs Without Timeslices
title_fullStr Drawing Dynamic Graphs Without Timeslices
title_full_unstemmed Drawing Dynamic Graphs Without Timeslices
title_sort Drawing Dynamic Graphs Without Timeslices
author_id_str_mv 8fa6987716a22304ef04d3c3d50ef266
author_id_fullname_str_mv 8fa6987716a22304ef04d3c3d50ef266_***_Daniel Archambault
author Daniel Archambault
author2 Paolo Simonetto
Daniel Archambault
Stephen Kobourov
format Conference Paper/Proceeding/Abstract
container_title Lecture Notes in Computer Science
container_volume 10692
container_start_page 394
publishDate 2018
institution Swansea University
isbn 9783319739144
9783319739151
issn 0302-9743
1611-3349
doi_str_mv 10.1007/978-3-319-73915-1_31
publisher Springer International Publishing
college_str Faculty of Science and Engineering
hierarchytype
hierarchy_top_id facultyofscienceandengineering
hierarchy_top_title Faculty of Science and Engineering
hierarchy_parent_id facultyofscienceandengineering
hierarchy_parent_title Faculty of Science and Engineering
department_str School of Mathematics and Computer Science - Computer Science{{{_:::_}}}Faculty of Science and Engineering{{{_:::_}}}School of Mathematics and Computer Science - Computer Science
document_store_str 1
active_str 0
description 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.
published_date 2018-01-21T03:43:32Z
_version_ 1763752031172952064
score 10.998048

Similar Items