2017 IEEE Pacific Visualization Symposium (PacificVis) (2017)

Seoul, South Korea

April 18, 2017 to April 21, 2017

ISSN: 2165-8773

ISBN: 978-1-5090-5739-9

pp: 21-25

An Nguyen , School of Information Technologies, University of Sydney, Australia

Seok-Hee Hong , School of Information Technologies, University of Sydney, Australia

ABSTRACT

We present a new multi-level graph drawing algorithm based on the k-core coarsening, a well-known cohesive subgroup analysis method in social network analysis. The k-core of a graph is also known as the degeneracy in graph theory, and can be computed in linear time. Our k-core based multi-level algorithm also includes a new concentric circle placement and a variation of force-directed layout to display the structure of graphs effectively. Experiments with real-world networks suggest that our algorithm performs well for visualization of large and complex scale-free networks, with a power-law degree distribution, a short diameter and a high clustering coefficient. Comparison with other multi-level algorithms shows that our method is fast and effective, in particular performs better than Walshaw [26] and FM

^{3}[15].INDEX TERMS

Layout, Clustering algorithms, Algorithm design and analysis, Gravity, Visualization, Social network services, Approximation algorithms

CITATION

An Nguyen and Seok-Hee Hong, "k-core based multi-level graph visualization for scale-free networks,"

*2017 IEEE Pacific Visualization Symposium (PacificVis)(PACIFICVIS)*, Seoul, South Korea, 2017, pp. 21-25.

doi:10.1109/PACIFICVIS.2017.8031574

CITATIONS