Home
This Title All WIREs
WIREs RSS Feed
How to cite this WIREs title:
WIREs Comp Stat

Visualizing large graphs

Full article on Wiley Online Library:   HTML PDF

Can't access this content? Tell your librarian.

With the prevalence of big data, there is a growing need for algorithms and techniques for visualizing very large and complex graphs. In this article, we review layout algorithms and interactive exploration techniques for large graphs. In addition, we briefly look at softwares and datasets for visualization graphs, as well as challenges that need to be addressed. WIREs Comput Stat 2015, 7:115–136. doi: 10.1002/wics.1343

Visualization of a small social network.
[ Normal View | Magnified View ]
Visualizations of an airline route graph. Left: Original layout. Right: Geometric edge bundling.
[ Normal View | Magnified View ]
Visualizations of a protein interaction graph: (a) Unsimplified; (b) Stochastic edge sampling; (c) Geodesic clustering; (d) Edge centrality based filtering.
[ Normal View | Magnified View ]
Large graph exploration through Degree‐of‐Interest diffusion. The data set is US legal document citation network.
[ Normal View | Magnified View ]
The five types of hierarchical abstraction based visualization. The interactive navigation methods on large graph visualization normally change the hierarchy setting within each type or switch between different types.
[ Normal View | Magnified View ]
Semantic and heterogeneous abstraction of large graphs. Left: PivotGraph of a communication network of people in a large company, x‐axis is division, y‐axis is office geography.107 Right: OnionGraph of a host/domain‐user‐application network in a commodity Ethernet setting.
[ Normal View | Magnified View ]
Large graph visualizations through node clustering.,,,
[ Normal View | Magnified View ]
Motif simplification of a network of wiki edits.
[ Normal View | Magnified View ]
Lossless compression a small network traffic graph.
[ Normal View | Magnified View ]
Example drawings of large graphs.
[ Normal View | Magnified View ]
Result of some of the algorithms applied to two graphs, dw256A and qh882.
[ Normal View | Magnified View ]
An illustration of the edge collapsing‐based graph coarsening. Left: original graph with 85 vertices. Edges in a maximal independent edge set are thickened. Right: a coarser graph with 43 vertices resulted from coalescing thickened edges.
[ Normal View | Magnified View ]
An illustration of the quadtree data structure. Left: the overall quadtree. Right: supernodes with reference to a vertex at the top middle part of the graph, with θ = 1.
[ Normal View | Magnified View ]

Browse by Topic

Data Mining > Exploratory Data Analysis
Data Visualization > Visualization of High Dimensional Data
Data Structures > Graph, Digraph, and Network Data

Access to this WIREs title is by subscription only.

Recommend to Your
Librarian Now!

The latest WIREs articles in your inbox

Sign Up for Article Alerts