MuGDAD: Multilevel graph drawing algorithm in a distributed architecture

2017 
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.
    • Correction
    • Source
    • Cite
    • Save
    • Machine Reading By IdeaReader
    0
    References
    3
    Citations
    NaN
    KQI
    []