Partitioning Approach to Visualization of Large Graphs

Batagelj, Vladimir and Mrvar, Andrej and Zaversnik, Matjaz (1999) Partitioning Approach to Visualization of Large Graphs. In: Graph Drawing 7th International Symposium, GD’99, September 15-19, 1999 , pp. 90-97(Official URL: http://dx.doi.org/10.1007/3-540-46648-7_9).

Full text not available from this repository.

Abstract

The structure of large graphs can be revealed by partitioning graphs to smaller parts, which are easier to handle. In the paper we propose the use of core decomposition as an efficient approach for partitioning large graphs. On the selected subgraphs, computationally more intensive, clustering and blockmodeling can be used to analyze their internal structure. The approach is illustrated by an analysis of Snyder & Kick's world trade graph.

Item Type: Conference Paper
Additional Information: 10.1007/3-540-46648-7_9
Classifications: M Methods > M.999 Others
G Algorithms and Complexity > G.350 Clusters
P Styles > P.999 Others
URI: http://gdea.informatik.uni-koeln.de/id/eprint/275

Actions (login required)

View Item View Item