TY - GEN
T1 - Vertex-neighboring multilevel force-directed graph drawing
AU - Toosi, Farshad Ghassemi
AU - Nikolov, Nikola S.
N1 - Publisher Copyright:
© 2016 IEEE.
PY - 2017/2/6
Y1 - 2017/2/6
N2 - We introduce a new force-directed graph drawing algorithm for large undirected graphs with at least a few hundreds of vertices. Our algorithm falls into the class of multilevel force-directed graph drawing algorithms. Unlike other multilevel algorithms it has no pre-processing step and it also ignores repulsion forces between pairs of non-adjacent vertices. As a result, our algorithm demonstrably outperforms known multilevel algorithms in terms of running time while keeping the quality of the layout sufficiently good.
AB - We introduce a new force-directed graph drawing algorithm for large undirected graphs with at least a few hundreds of vertices. Our algorithm falls into the class of multilevel force-directed graph drawing algorithms. Unlike other multilevel algorithms it has no pre-processing step and it also ignores repulsion forces between pairs of non-adjacent vertices. As a result, our algorithm demonstrably outperforms known multilevel algorithms in terms of running time while keeping the quality of the layout sufficiently good.
KW - Big Graph Visualization
KW - Multilevel Force-Directed
UR - http://www.scopus.com/inward/record.url?scp=85015797100&partnerID=8YFLogxK
U2 - 10.1109/SMC.2016.7844696
DO - 10.1109/SMC.2016.7844696
M3 - Conference contribution
AN - SCOPUS:85015797100
T3 - 2016 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2016 - Conference Proceedings
SP - 2996
EP - 3001
BT - 2016 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2016 - Conference Proceedings
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2016 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2016
Y2 - 9 October 2016 through 12 October 2016
ER -