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
31
Mesh Segmentation via Spectral Embedding and Contour Analysis
Rong Liu, Hao Zhang · Computer Graphics Forum · 2007 · 124 citations
Simulating hyperbolic space on a circuit board
Patrick M. Lenggenhager, Alexander Stegmaier, Lavi K. Upreti et al. · Nature Communications · 2022 · 117 citations · Full text
Linearized cluster assignment via spectral ordering
Chris Ding, Xiaofeng He · 2004 · 85 citations
1–5 of 31
85
3
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 85
57

Xi'an Jiaotong University
Xi'an, China
2 h-index
4 publications
200 citations

Pennsylvania State University
State College, United States
2 h-index
3 publications
107 citations

Guangdong University of Foreign Studies
Guangzhou, China
2 h-index
2 publications
27 citations

University of Helsinki
Helsinki, Finland
2 h-index
5 publications
211 citations
University of Nebraska–Lincoln
Lincoln, United States
1 h-index
1 publications
41 citations
Universitat Politècnica de València
Valencia, Spain
1 h-index
2 publications
28 citations
Louisiana State University
Baton Rouge, United States
1 h-index
1 publications
41 citations
Pontifícia Universidade Católica do Rio de Janeiro
Rio de Janeiro, Brazil
1 h-index
2 publications
116 citations
1–8 of 57
3 publications · 42 citations
3
h-index
2 publications · 100 citations
2
h-index
2 publications · 32 citations
2
h-index
2 publications · 58 citations
2
h-index
Conference · 1 publications · 55 citations
1
h-index
1–5