Parallel graph layout algorithm for large-scale graph data

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.

Keywords

• force-directed algorithm;visualization analysis;social network;parallel layout algorithm