Vertex-neighboring multilevel force-directed graph drawing

Farshad Ghassemi Toosi, Nikola S. Nikolov

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

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.

Original languageEnglish
Title of host publication2016 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2016 - Conference Proceedings
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages2996-3001
Number of pages6
ISBN (Electronic)9781509018970
DOIs
Publication statusPublished - 6 Feb 2017
Event2016 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2016 - Budapest, Hungary
Duration: 9 Oct 201612 Oct 2016

Publication series

Name2016 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2016 - Conference Proceedings

Conference

Conference2016 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2016
Country/TerritoryHungary
CityBudapest
Period9/10/1612/10/16

Keywords

  • Big Graph Visualization
  • Multilevel Force-Directed

Fingerprint

Dive into the research topics of 'Vertex-neighboring multilevel force-directed graph drawing'. Together they form a unique fingerprint.

Cite this