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

Authors

12

  1. DA
    David Auber

    Laboratoire Bordelais de Recherche en Informatique, France

    1 publications · 15 citations

    1

    h-index

  2. CG
    Craig Gotsman

    Technion – Israel Institute of Technology, Israel

    1 publications · 33 citations

    1

    h-index

  3. KL
    Kelly Lyons

    University of Toronto, Canada

    1 publications · 30 citations

    1

    h-index

  4. AA
    Alessio Arleo

    TU Wien, Austria

    1 publications · 25 citations

    1

    h-index

  5. AH
    Antoine Hinge

    Technical University of Denmark, Denmark

    1 publications · 15 citations

    1

    h-index

1–5 of 12

Venues

  1. Journal of Graph Algorithms and Applications

    JGAA · 1 publications · 33 citations

    1

    h-index

  2. arXiv (Cornell University)

    Repository · 1 publications · 19 citations

    1

    h-index

  3. Information Sciences

    1 publications · 25 citations

    1

    h-index

1–3