Repository logo
 
Publication

Parallel implementation of force algorithms for graph visualization

2021Journal article Open access
Simple item page
dc.contributor.authorZhansultan, Abenov
dc.contributor.authorSanzhar, Aubakirov
dc.contributor.authorTrigo, Paulo
dc.date.accessioned2022-07-06T12:38:55Z
dc.date.available2022-07-06T12:38:55Z
dc.date.issued2021
dc.description.abstractIn this paper we select some graph generate-and-render algorithms and evaluate their performance. The experimental results ground our proposal of a parallelized version of an algorithm (the Force Atlas 2) and the corresponding performance analysis. Our work resorts to graph visualization tools such as D3.js, jgraph, NetworkX, Gephi, and sigma.js. We analyze how to use those tools, their advantages and disadvantages and compare their performance. Since each of those tools use their own algorithms, we also conducted a comparative review of graph visualization algorithms. We reviewed algorithms such as FA (Force Atlas), FA2 (Force Atlas 2), FR (Fruchterman & Reingold), LinLog and Dijkstra (Dijkstra's algorithm). The different algorithms were experimentally compared on the same data. The experiments enabled to build a performance ranked perspective. The fastest algorithm was chosen, and experiments were carried out to optimize the rate of generation of graph coordinates by introducing parallel computations during the generation of graph coordinates. During the experiments, the best visualization algorithm for Force Atlas 2 graphs was identified and selected. This algorithm was parallelized, and we achieved a relevant speedup ratio around 26.7% and parallel efficiency around 30%.pt_PT
dc.description.versioninfo:eu-repo/semantics/publishedVersionpt_PT
dc.identifier.citationZHANSULTAN, Abenov; SANZHAR, Aubakirov; TRIGO, Paulo – Parallel implementation of force algorithms for graph visualization. Journal of Theoretical and Applied Information Technology. ISSN 1992-8645. Vol. 99, N.º 2 (2021), pp. 503-515.pt_PT
dc.identifier.eissn1817-3195
dc.identifier.issn1992-8645
dc.identifier.urihttp://hdl.handle.net/10400.21/14788
dc.language.isoengpt_PT
dc.peerreviewedyespt_PT
dc.publisherAsian Research Publication Networkpt_PT
dc.relation.publisherversionhttp://www.jatit.org/volumes/Vol99No2/21Vol99No2.pdfpt_PT
dc.subjectGraphspt_PT
dc.subjectDirectedpt_PT
dc.subjectNon-directedpt_PT
dc.subjectD3.jspt_PT
dc.subjectFApt_PT
dc.subjectFA2pt_PT
dc.subjectJgraphpt_PT
dc.subjectNetworkXpt_PT
dc.subjectGephipt_PT
dc.subjectSigma.jspt_PT
dc.subjectFRpt_PT
dc.subjectDijkstrapt_PT
dc.subjectLinLogpt_PT
dc.titleParallel implementation of force algorithms for graph visualizationpt_PT
dc.typejournal article
dspace.entity.typePublication
oaire.citation.endPage515pt_PT
oaire.citation.issue2pt_PT
oaire.citation.startPage503pt_PT
oaire.citation.titleJournal of Theoretical and Applied Information Technologypt_PT
oaire.citation.volume99pt_PT
person.familyNameTrigo
person.givenNamePaulo
person.identifier.ciencia-idF011-8BE3-FEB1
person.identifier.orcid0000-0001-5850-615X
person.identifier.scopus-author-id15043375100
rcaap.rightsopenAccesspt_PT
rcaap.typearticlept_PT
relation.isAuthorOfPublication0381c0ca-c205-4ef3-b928-418f4f947630
relation.isAuthorOfPublication.latestForDiscovery0381c0ca-c205-4ef3-b928-418f4f947630

Files

Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
Parallel_PTrigo.pdf
Size:
587.62 KB
Format:
Adobe Portable Document Format
Download

Collections

ISEL - Eng. Elect. Tel. Comp. - Artigos