Logo image
A simplification algorithm for visualizing the structure of complex graphs
Conference proceeding   Open access

A simplification algorithm for visualizing the structure of complex graphs

Daniel Hennessey, Daniel Brooks, Alex Fridman and David Breen
PROCEEDINGS OF THE 12TH INTERNATIONAL INFORMATION VISUALISATION, pp 616-625
01 Jan 2008
url
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.151.2994View

Abstract

Computer Science Computer Science, Artificial Intelligence Engineering Engineering, Electrical & Electronic Imaging Science & Photographic Technology Science & Technology Technology
Complex graphs, ones containing thousands of nodes of high degree, are difficult to visualize. Displaying all of the nodes and edges of these graphs can create an incomprehensible cluttered output. This paper presents a simplification algorithm that may be applied to a complex graph in order to produce a controlled thinning of the graph. Using importance metrics, the simplification process removes nodes from the graph, leaving the central structure for visualization and evaluation. The simplification algorithm consists of two steps, calculation of the importance metrics and pruning. Several metrics based on various topological graph properties are described. The metrics are then used in a pruning process to simplify the graph. Nodes, along with their corresponding edges, are removed from the graphy while maintaining the graph's overall connectivity. This simplified graph provides a cleaner more meaningful visual representation of the graph's structure; thus aiding the analysis of the graph's underlying data.

Metrics

8 Record Views
12 citations in Scopus

Details

InCites Highlights

Data related to this publication, from InCites Benchmarking & Analytics tool:

Web of Science research areas
Computer Science, Artificial Intelligence
Engineering, Electrical & Electronic
Imaging Science & Photographic Technology
Logo image