Drawing large weighted graphs using clustered force-directed algorithm

Publication Type:
Conference Proceeding
Proceedings of the International Conference on Information Visualisation, 2014, pp. 13 - 17
Issue Date:
Full metadata record
Files in This Item:
Filename Description Size
ThumbnailDrawing Large Weighted Graphs Using Clustered Force-Directed Algorithm.pdf Published version224.05 kB
Adobe PDF
© 2014 IEEE. Clustered graph drawing is widely considered as a good method to overcome the scalability problem when visualizing large (or huge) graphs. Force-directed algorithm is a popular approach for laying graphs yet small to medium size datasets due to its slow convergence time. This paper proposes a new method which combines clustering and a force-directed algorithm, to reduce the computational complexity and time. It works by dividing a Long Convergence: LC into two Short Convergences: SC1, SC2, where SC1+SC2 < LC. We also apply our work on weighted graphs. Our experiments show that the new method improves the aesthetics in graph visualization by providing clearer views for connectivity and edge weights.
Please use this identifier to cite or link to this item: