ivga: A fast force-directed method for interactive visualization of complex networks

被引:9
作者
Dzwinel, Witold [1 ]
Wcislo, Rafal [1 ]
Czech, Wojciech [1 ]
机构
[1] AGH Univ Sci & Technol, Dept Comp Sci, Krakow, Poland
关键词
Graph visualization; Complex networks; Force-directed method; Big Data;
D O I
10.1016/j.jocs.2016.09.001
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Complex networks play a very important role in various fields of science as data structures, which aggregate information about mutual relationships between numerous objects. The structural properties of these large graphs can be scrutinized throughout their interactive visualization. However, visual analysis of complex networks consisting of vertical bar V vertical bar similar to 10(6+) vertices represents a great challenge for nowadays computer systems both from computational and storage perspective. Therefore, the existing graph drawing methods involving greater than O(vertical bar V vertical bar) time and space complexity cannot be regarded as promising tools in the advent of the Big Data era. We present here a new and very fast graph drawing method with O(vertical bar V vertical bar) time and space complexity - ivga (interactive visualization of graphs). We evaluate its usefulness and performance by testing ivga on the large complex networks from the Stanford Large Network Dataset Collection. We demonstrate that ivga allows for very fast interactive visualization of large graphs consisting of up to a few million vertices on a regular laptop what makes it very competitive to other state-of-art graph drawing methods. Particularly, we recommend ivga method for interactive visualization of large non-planar complex networks such as small-world and scale-free social networks. The main concept of ivga can be seriously considered in developing tools for visualization and analysis of really huge networks, with billions of vertices and edges, on Big Data systems. (C) 2016 Elsevier B.V. All rights reserved.
引用
收藏
页码:448 / 459
页数:12
相关论文
共 36 条
  • [1] Molecular dynamics multidimensional scaling
    Andrecut, M.
    [J]. PHYSICS LETTERS A, 2009, 373 (23-24) : 2001 - 2006
  • [2] [Anonymous], 1952, Psychometrika
  • [3] [Anonymous], 2013, WTF: The Who to Follow Service at Twitter, DOI DOI 10.1145/2488388.2488433
  • [4] [Anonymous], 2006, Mathematica journal, DOI DOI 10.3402/QHW.V6I2.5918
  • [5] Battista D., 1999, GRAPH DRAWING ALGORI, P394
  • [6] Brath R., 2015, GRAPH ANAL VISUALIZA, P544
  • [7] Invariants of distance k-graphs for graph embedding
    Czech, Wojciech
    [J]. PATTERN RECOGNITION LETTERS, 2012, 33 (15) : 1968 - 1979
  • [8] The University of Florida Sparse Matrix Collection
    Davis, Timothy A.
    Hu, Yifan
    [J]. ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE, 2011, 38 (01):
  • [9] Dwyer T., 2003, GRAPH DRAWING SOFTWA, P378
  • [10] Method of particles in visual clustering of multi-dimensional and large data sets
    Dzwinel, W
    Blasiak, J
    [J]. FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF GRID COMPUTING AND ESCIENCE, 1999, 15 (03): : 365 - 379