University of Konstanz
Graduiertenkolleg / PhD Program
Computer and Information Science

Graduation Talks


Dynamic Network Visualization


Martin Mader, University Konstanz
Konstanz, Germany

date & place

Wednesday, 14.07.2010, 13:15 h
Room C 252


As dynamic networks, i.e., networks comprising a sequence of graphs, receive increasing interest by network analysts, there is a strong need for appropriate layout methods. The main task is to adapt static graph drawing algorithms to respect constraints on changes in the network representations, and thus, to solve the problem of finding coherent representations of successive networks. The latter is often referred to as preserving an observer's mental map or maintaining stability.
This thesis is to present systematic adaptions of an energy-based graph layout method called stress minimization, which is well studied and has been proven to produce better layouts than other energy-based techniques (C. Pich, PhD thesis, 2009). We will follow the three most common approaches to explicitly introduce stability, namely aggregation, anchoring and linking. Consistent adaption of stress minimization to the respective approaches yields satisfying results, and enables us to conduct an exhaustive quantitative study to compare them. Finally, we want to demonstrate that concepts used for dynamic network layout may also be useful for other network information visualization tasks.