Untangling Hairballs

Nocaj, Arlind and Ortmann, Mark and Brandes, Ulrik (2014) Untangling Hairballs. In: Graph Drawing 22nd International Symposium, GD 2014, September 24-26, 2014 , pp. 101-112(Official URL: http://dx.doi.org/10.1007/978-3-662-45803-7_9).

Full text not available from this repository.

Abstract

Small-world graphs have characteristically low average distance and thus cause force-directed methods to generate drawings that look like hairballs. This is by design as the inherent objective of these methods is a globally uniform edge length or, more generally, accurate distance representation. The problem arises in graphs of high density or high conductance, and in the presence of high-degree vertices, all of which tend to pull vertices together and thus clutter variation in local density. We here propose a method to draw online social networks, a special class of hairball graphs. The method is based on a spanning subgraph that is sparse but connected and consists of strong ties holding together communities. To identify these ties we propose a novel measure of embeddedness. It is based on a weighted accumulation of triangles in quadrangles and can be determined efficiently. An evaluation on empirical and generated networks indicates that our approach improves upon previous methods using other edge indices. Although primarily designed to achieve more informative drawings, our spanning subgraph may also serve as a sparsifier that trims a hairball graph before the application of a clustering algorithm.

Item Type: Conference Paper
Additional Information: 10.1007/978-3-662-45803-7_9
Classifications: D Aesthetics > D.999 Others
G Algorithms and Complexity > G.350 Clusters
M Methods > M.999 Others
Divisions: UNSPECIFIED
Depositing User: Administration GDEA
Date Deposited: 22 May 2015 09:01
Last Modified: 22 May 2015 09:01
URI: http://gdea.informatik.uni-koeln.de/id/eprint/1425

Actions (login required)

View Item View Item