Interactive Poster: Exploring Time-Varying Hypergraphs

Time-varying graphs occur frequently in many applications, e.g., as social networks or as ad-hoc computer networks. This interactive poster focuses on hypergraphs (graphs with edges that connect more than two nodes) and introduces a novel overview+detail concept for their visual exploration. It combines a bipartite view for detailed inspection and comparison with the computation of structural measures over time for a larger scale investigation. The visualization (Section 1), its use for exploration (Section 2), its application to a simulated biochemical reaction network (Section 3) and future research directions (Section 4) are presented in this extended poster abstract.

[1]  Danail Bonchev,et al.  Chemical Reaction Networks: A Graph-Theoretical Approach , 1996 .

[2]  Danail Bonchev,et al.  Quantitative Measures of Network Complexity , 2005 .

[3]  Jan Himmelspach,et al.  JAMES II - Experiences and Interpretations , 2009, Multi-Agent Systems.

[4]  Xuelong Li,et al.  A survey of graph edit distance , 2010, Pattern Analysis and Applications.

[5]  Gautam Kumar,et al.  Visual Exploration of Complex Time-Varying Graphs , 2006, IEEE Transactions on Visualization and Computer Graphics.

[6]  Mathias Pohl,et al.  Interactive Exploration of Large Dynamic Networks , 2008, VISUAL.

[7]  Heidrun Schumann,et al.  Visual Analysis of Bipartite Biological Networks , 2008, VCBM.

[8]  Marti A. Hearst,et al.  Animated exploration of dynamic graphs with radial layout , 2001, IEEE Symposium on Information Visualization, 2001. INFOVIS 2001..

[9]  Kazuo Misue,et al.  Drawing bipartite graphs as anchored maps , 2006, APVIS.