Spectral Ordering

Spectral Ordering is a graph vertex ordering technique that arranges nodes based on the eigenvectors of the graph’s Laplacian matrix to reveal structural patterns in adjacency matrix visualizations.

31

Publications

1.1K

Citations

85

Authors

57

Institutions

Publications per year

2017–2026

8

Authors

85

  1. AP
    Alex Pothen

    Purdue University West Lafayette, United States

    3 publications · 130 citations

    3

    h-index

  2. LW
    L. Wang

    Pennsylvania State University, United States

    2 publications · 81 citations

    2

    h-index

  3. ML
    Muhuo Liu

    South China Agricultural University, China

    2 publications · 37 citations

    2

    h-index

  4. HD
    Horst D. Simon

    Lawrence Berkeley National Laboratory, United States

    2 publications · 81 citations

    2

    h-index

  5. SB
    S. Barnard

    Ames Research Center, United States

    2 publications · 81 citations

    2

    h-index

1–5 of 85

Venues

  1. Linear and Multilinear Algebra

    3 publications · 42 citations

    3

    h-index

  2. European Journal of Combinatorics

    2 publications · 100 citations

    2

    h-index

  3. Discrete Mathematics

    2 publications · 32 citations

    2

    h-index

  4. Linear Algebra and its Applications

    2 publications · 58 citations

    2

    h-index

  5. Conference on High Performance Computing (Supercomputing)

    Conference · 1 publications · 55 citations

    1

    h-index

1–5