Distributed Graph Drawing
Distributed Graph Drawing is a graph layout algorithm that partitions the computational task of embedding a graph into spatial coordinates across multiple processing units or nodes, leveraging parallel and decentralized computation to handle large-scale graphs efficiently.
5
Publications
122
Citations
12
Authors
6
Institutions
Publications per year
2017–2026
0
Parents
5
Cluster busting in anchored graph drawing
Kelly Lyons · 1992 · 30 citations
Large graph visualizations using a distributed computing platform
Alessio Arleo, Walter Didimo, Giuseppe Liotta et al. · Information Sciences · 2016 · 25 citations
Distributed Graph Layout with Spark
Antoine Hinge, David Auber · 2015 · 15 citations · Full text
1–5 of 5
12
1
h-index
1
h-index
1
h-index
1
h-index
1
h-index
1–5 of 12
6
University of Perugia
Perugia, Italy
1 h-index
4 publications
100 citations
AT&T (United States)
Bedminster, United States
1 h-index
1 publications
33 citations
Queen's University
Kingston, Canada
1 h-index
1 publications
30 citations
John Brown University
Siloam Springs, United States
1 h-index
2 publications
38 citations

Harvard University Press
Cambridge, United States
1 h-index
1 publications
33 citations
Association for Computing Machinery
New York, United States
1 h-index
1 publications
19 citations
1–6 of 6
JGAA · 1 publications · 33 citations
1
h-index
Repository · 1 publications · 19 citations
1
h-index
1 publications · 25 citations
1
h-index
1–3