Stress Majorization

Stress Majorization is a numerical optimization method for graph layout that minimizes a stress function by iteratively refining node positions through a sequence of weighted least-squares updates, distinguishing itself from other layout techniques through its convergence guarantees and use of majorization to simplify the original non-linear, non-convex optimization problem.

8

Publications

941

Citations

24

Authors

9

Institutions

Publications per year

2017–2026

1

Authors

24

  1. TD
    Tim Dwyer

    Monash University, Australia

    2 publications · 127 citations

    2

    h-index

  2. PM
    Patrick Mair

    Harvard University, United States

    2 publications · 605 citations

    2

    h-index

  3. KM
    Kim Marriott

    Monash University, Australia

    2 publications · 127 citations

    2

    h-index

  4. JD
    Jan de Leeuw

    University of California, Los Angeles, United States

    2 publications · 605 citations

    2

    h-index

  5. YK
    Yehuda Koren

    AT&T (United States), United States

    2 publications · 127 citations

    2

    h-index

1–5 of 24

Venues

  1. IEEE Transactions on Visualization and Computer Graphics

    TVCG · 3 publications · 244 citations

    3

    h-index

  2. WU Research

    Repository · 1 publications · 124 citations

    1

    h-index

  3. Journal of Statistical Software

    JSS · 1 publications · 481 citations

    1

    h-index

  4. Discrete Mathematics

    1 publications · 23 citations

    1

    h-index

  5. Computer Graphics Forum

    1 publications · 44 citations

    1

    h-index

1–5