MuGDAD: Multilevel graph drawing algorithm in a distributed architecture

Abstract : This paper presents a multiparadigm force-directed graph drawing algorithm with horizontal scalability on distributed storage clusters. Adaptations of the classical force-directed scheme that function on a distributed environment are presented. This distributed force-directed scheme is associated with a distributed-compatible multilevel approach for a more efficient graph drawing algorithm. MuGDAD is compared in terms of layout quality and speed with other algorithms.
Complete list of metadatas

Cited literature [24 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01516889
Contributor : Antoine Hinge <>
Submitted on : Tuesday, May 2, 2017 - 1:50:15 PM
Last modification on : Monday, February 5, 2018 - 11:38:01 AM

File

MuGDAD_rev_012.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01516889, version 1

Collections

Citation

Antoine Hinge, Gaëlle Richer, David Auber. MuGDAD: Multilevel graph drawing algorithm in a distributed architecture . Conference on Computer Graphics, Visualization and Computer Vision, IADIS, Jul 2017, Lisbon, Portugal. pp.189. ⟨hal-01516889⟩

Share

Metrics

Record views

158

Files downloads

178