Parallel Force-directed Algorithms

Parallel Force-Directed Algorithms is a computational method in graph layout that accelerates force-directed visualization by distributing the calculation of nodal forces across multiple processing units to enable efficient rendering of large-scale networks.

8

Publications

586

Citations

23

Authors

15

Institutions

Publications per year

2017–2026

3

Authors

23

  1. ED
    Eric Darve

    Stanford University, United States

    1 publications · 13 citations

    1

    h-index

  2. SM
    Shawn Martin

    Sandia National Laboratories California, United States

    1 publications · 281 citations

    1

    h-index

  3. RK
    Richard Klavans

    SciTech Strategies (United States), United States

    1 publications · 281 citations

    1

    h-index

  4. YS
    Yain‐Whar Si

    University of Macau, Macao SAR China

    1 publications · 41 citations

    1

    h-index

  5. WM
    William M. Brown

    Oak Ridge National Laboratory, United States

    1 publications · 281 citations

    1

    h-index

1–5 of 23

Venues

  1. 1

    h-index

  2. 2012 16th International Conference on Information Visualisation

    Conference · 1 publications · 16 citations

    1

    h-index

  3. Computational Geometry

    1 publications · 98 citations

    1

    h-index

  4. IEEE Transactions on Visualization and Computer Graphics

    TVCG · 1 publications · 110 citations

    1

    h-index

  5. Information Visualization

    1 publications · 41 citations

    1

    h-index

1–5