Interactive level-of-detail rendering of large graphs

Fig. 1 . Application of our visualization technique on a hierarchical data set, zooming from overview (left) to a region of interest (right). The density-based node aggregation field (blue color) guides edge aggregation (orange/red color) to reveal visual patterns at different levels of detail. Abstract-We propose a technique that allows straight-line graph drawings to be rendered interactively with adjustable level of detail. The approach consists of a novel combination of edge cumulation with density-based node aggregation and is designed to exploit common graphics hardware for speed. It operates directly on graph data and does not require precomputed hierarchies or meshes. As proof of concept, we present an implementation that scales to graphs with millions of nodes and edges, and discuss several example applications

Interaktive Visualisierung großer Graphen mittels aggregierender Kernel Funktionen

I propose a new graph visualization technique that allows the interactive exploration of large datasets with adjustable level of detail. The approach is designed to exploit the architecture of common graphics hardware and achieves interactive speed through parallelization. To address information hiding through node and edge clutter, I replace the standard node link diagram with a novel combination of a continous node-density visualization with discrete meta-edges. Additionally, I present a zoom & pan based user interface that allows the intuitive exploration of the data at distinct aggregation levels and supports filter and detail on demand mechanisms to address the characteristics of different datasets and research questions

Performance analysis of routing algorithms in interest-based mobile social networks

Diese Arbeit analysiert den in "I seek for knowledge: Exploiting social properties in mobile ad hoc networks" skizzierten Routingalgorithmus anhand einer Referenzimplementierung, die auf unterschiedlichen sozialen Netzwerken getestet wird.Bei ISeek handelt es sich um einen Routingalgorithmus, der Informationsanfragen in einem DTN (delay tolerant network) an Antwortressourcen zustellt. Der Fokus liegt hierbei auf sozialen Netzwerken, deren transitive Verbindungen (Small World Phänomen) von dem Algorithmus ausgenutzt werden.Der Algorithmus implementiert eine Art intelligentes Flooding um in einer lokalen Umgebung Nachrichten auf zielführenden Pfaden zuzustellen. Alle Routingentscheidungen werden lokal auf den beteiligten Knoten getroffen

Interactive Level-of-Detail Rendering of Large Graphs

We propose a technique that allows straight-line graph drawings to be rendered interactively with adjustable level of detail. The approach consists of a novel combination of edge cumulation with density-based node aggregation and is designed to exploit common graphics hardware for speed. It operates directly on graph data and does not require precomputed hierarchies or meshes. As proof of concept, we present an implementation that scales to graphs with millions of nodes and edges, and discuss several example applications