Concepedia

Spectral Graph Layout

Spectral Graph Layout is a graph layout method that computes node positions by applying eigenvectors of a graph matrix, such as the Laplacian, to embed nodes in low-dimensional space based on the graph’s global structural properties.

2

Publications

45

Citations

3

Authors

1

Institutions

Publications per year

2017–2026

1

Parents

Publications

2

1–3 of 2

Authors

3

  1. UD
    Uğur Doğrusöz

    Bilkent University, Türkiye

    1 publications · 22 citations

    1

    h-index

  2. UB
    Ulrik Brandes

    University of Konstanz, Germany

    1 publications · 23 citations

    1

    h-index

  3. SC
    Sabine Cornelsen

    University of Konstanz, Germany

    1 publications · 23 citations

    1

    h-index

  4. AM
    Ashirbad Mishra

    National Institute of Advanced Studies, India

    1 publications · 10 citations

    0

    h-index

  5. KM
    Kamesh Madduri

    Pennsylvania State University, United States

    1 publications · 10 citations

    0

    h-index

1–5 of 3

Institutions

1

  1. Bilkent University

    Ankara, Türkiye

    1 h-index

    1 publications

    22 citations

  2. eBay (Ireland)

    Dublin, Ireland

    1 publications

    10 citations

  3. Pennsylvania State University

    State College, United States

    1 publications

    10 citations

1–3 of 1

Venues

  1. IEEE Transactions on Visualization and Computer Graphics

    TVCG · 1 publications · 22 citations

    1

    h-index

  2. Journal of Graph Algorithms and Applications

    JGAA · 1 publications · 23 citations

    1

    h-index

1–2