Science China Information Sciences
, Volume 55, Issue 3, pp 677688
First online:
A fast successive overrelaxation algorithm for forcedirected network graph drawing
 YongXian WangAffiliated withNational Key Laboratory for Parallel and Distributed Processing, National University of Defense Technology Email author
 , ZhengHua WangAffiliated withNational Key Laboratory for Parallel and Distributed Processing, National University of Defense Technology
Rent the article at a discount
Rent now* Final gross prices may vary according to local VAT.
Get AccessAbstract
Forcedirected approach is one of the most widely used methods in graph drawing research. There are two main problems with the traditional forcedirected algorithms. First, there is no mature theory to ensure the convergence of iteration sequence used in the algorithm and further, it is hard to estimate the rate of convergence even if the convergence is satisfied. Second, the running time cost is increased intolerablely in drawing largescale graphs, and therefore the advantages of the forcedirected approach are limited in practice. This paper is focused on these problems and presents a sufficient condition for ensuring the convergence of iterations. We then develop a practical heuristic algorithm for speeding up the iteration in forcedirected approach using a successive overrelaxation (SOR) strategy. The results of computational tests on the several benchmark graph datasets used widely in graph drawing research show that our algorithm can dramatically improve the performance of forcedirected approach by decreasing both the number of iterations and running time, and is 1.5 times faster than the latter on average.
Keywords
graph drawing graph layout successive overrelaxation forcedirected algorithm Title
 A fast successive overrelaxation algorithm for forcedirected network graph drawing
 Journal

Science China Information Sciences
Volume 55, Issue 3 , pp 677688
 Cover Date
 201203
 DOI
 10.1007/s1143201142089
 Print ISSN
 1674733X
 Online ISSN
 18691919
 Publisher
 SP Science China Press
 Additional Links
 Topics
 Keywords

 graph drawing
 graph layout
 successive overrelaxation
 forcedirected algorithm
 Industry Sectors
 Authors

 YongXian Wang ^{(1)}
 ZhengHua Wang ^{(1)}
 Author Affiliations

 1. National Key Laboratory for Parallel and Distributed Processing, National University of Defense Technology, Changsha, 410073, China