An incremental layout method for visualizing online dynamic graphs

Tarik Crnovrsanin, Jacqueline Chu, Kwan-Liu Ma

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

Having the ability to draw dynamic graphs is key to better understanding evolving relationships and analyzing the patterns and trends in a network. Traditional force-directed methods are not suitable for laying out dynamic graphs because of their design for static graphs. An alternative is to create an incremental version of the force multilevel multi-pole method (FM3); however, previous solutions are more susceptible to graph degradation, that is, graph illegibility due to long edges or edge crossings. This is typically caused when distant components are connected, resulting in long and overlapping edges. We present our incremental version of FM3 with a refinement scheme, which solves this problem by “refining” the parts of the graph with high energy. Our resulting visualization maintains readability of the graph structure and is efficient in laying out these changing networks. We evaluate the effectiveness of our method by comparing it with two previous online dynamic graph methods.

Original languageEnglish (US)
Pages (from-to)55-80
Number of pages26
JournalJournal of Graph Algorithms and Applications
Volume21
Issue number1
DOIs
StatePublished - Jan 1 2017

Fingerprint

Dynamic Graphs
Layout
Graph in graph theory
Refining
Poles
Visualization
Degradation
Overlapping
High Energy
Pole
Refinement
Evaluate
Alternatives

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)
  • Computer Science Applications
  • Geometry and Topology
  • Computational Theory and Mathematics

Cite this

An incremental layout method for visualizing online dynamic graphs. / Crnovrsanin, Tarik; Chu, Jacqueline; Ma, Kwan-Liu.

In: Journal of Graph Algorithms and Applications, Vol. 21, No. 1, 01.01.2017, p. 55-80.

Research output: Contribution to journalArticle

@article{d3e064302f764e73b74f1efe9b8139ed,
title = "An incremental layout method for visualizing online dynamic graphs",
abstract = "Having the ability to draw dynamic graphs is key to better understanding evolving relationships and analyzing the patterns and trends in a network. Traditional force-directed methods are not suitable for laying out dynamic graphs because of their design for static graphs. An alternative is to create an incremental version of the force multilevel multi-pole method (FM3); however, previous solutions are more susceptible to graph degradation, that is, graph illegibility due to long edges or edge crossings. This is typically caused when distant components are connected, resulting in long and overlapping edges. We present our incremental version of FM3 with a refinement scheme, which solves this problem by “refining” the parts of the graph with high energy. Our resulting visualization maintains readability of the graph structure and is efficient in laying out these changing networks. We evaluate the effectiveness of our method by comparing it with two previous online dynamic graph methods.",
author = "Tarik Crnovrsanin and Jacqueline Chu and Kwan-Liu Ma",
year = "2017",
month = "1",
day = "1",
doi = "10.7155/jgaa.00406",
language = "English (US)",
volume = "21",
pages = "55--80",
journal = "Journal of Graph Algorithms and Applications",
issn = "1526-1719",
publisher = "Brown University",
number = "1",

}

TY - JOUR

T1 - An incremental layout method for visualizing online dynamic graphs

AU - Crnovrsanin, Tarik

AU - Chu, Jacqueline

AU - Ma, Kwan-Liu

PY - 2017/1/1

Y1 - 2017/1/1

N2 - Having the ability to draw dynamic graphs is key to better understanding evolving relationships and analyzing the patterns and trends in a network. Traditional force-directed methods are not suitable for laying out dynamic graphs because of their design for static graphs. An alternative is to create an incremental version of the force multilevel multi-pole method (FM3); however, previous solutions are more susceptible to graph degradation, that is, graph illegibility due to long edges or edge crossings. This is typically caused when distant components are connected, resulting in long and overlapping edges. We present our incremental version of FM3 with a refinement scheme, which solves this problem by “refining” the parts of the graph with high energy. Our resulting visualization maintains readability of the graph structure and is efficient in laying out these changing networks. We evaluate the effectiveness of our method by comparing it with two previous online dynamic graph methods.

AB - Having the ability to draw dynamic graphs is key to better understanding evolving relationships and analyzing the patterns and trends in a network. Traditional force-directed methods are not suitable for laying out dynamic graphs because of their design for static graphs. An alternative is to create an incremental version of the force multilevel multi-pole method (FM3); however, previous solutions are more susceptible to graph degradation, that is, graph illegibility due to long edges or edge crossings. This is typically caused when distant components are connected, resulting in long and overlapping edges. We present our incremental version of FM3 with a refinement scheme, which solves this problem by “refining” the parts of the graph with high energy. Our resulting visualization maintains readability of the graph structure and is efficient in laying out these changing networks. We evaluate the effectiveness of our method by comparing it with two previous online dynamic graph methods.

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

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

U2 - 10.7155/jgaa.00406

DO - 10.7155/jgaa.00406

M3 - Article

AN - SCOPUS:85010952491

VL - 21

SP - 55

EP - 80

JO - Journal of Graph Algorithms and Applications

JF - Journal of Graph Algorithms and Applications

SN - 1526-1719

IS - 1

ER -