Big Data Research ›› 2016, Vol. 2 ›› Issue (5): 12-21.doi: 10.11959/j.issn.2096-0271.2016050

Previous Articles     Next Articles

Parallel graph layout algorithm for large-scale graph data

Zhiyuan CHENG,Yubin BAO,Fangling LENG   

  1. Department of Computer Science of Northeastern University,Shenyang 110819,China
  • Online:2016-09-20 Published:2018-02-08
  • Supported by:
    The National Natural Science Foundation of China

Abstract:

Graph models are modeling tools which are widely used.Data visualization techniques have been widely used as intuitive data analysis tools.Graph layout algorithm is the most critical technique of graph visualization,while there are no effective parallel graph layout algorithms.So to study on visualization of massive graph data is a challenging problem.Aiming at this problem,based on the force-directed layout algorithm and ignoring the repulsion force computation between weakly associated vertexes partially,a k-friend approximate layout algorithm was proposed,and an effective parallel layout algorithm was designed for massive graph data.The experimental results on artificial and real dataset show that the algorithms proposed greatly improve the layout speed.

Key words: force-directed algorithm, visualization analysis, social network, parallel layout algorithm

No Suggested Reading articles found!