Spectral Layout is a graph layout algorithm that positions nodes based on the eigenvectors of a matrix derived from the graph structure, such as the Laplacian matrix, to reveal inherent geometric and clustering properties of the network.
3
Publications
1.2K
Citations
12
Authors
7
Institutions
Publications per year
2017–2026
0
Variants
Spectral Graph Drawing
Parents
Publications
3
1–3 of 3
Authors
12
- DI
1
h-index
- MB
1
h-index
- SK
1
h-index
- SL
1
h-index
- KB
1
h-index
1–5 of 12
Institutions
7
Sony (Taiwan)
Taipei, Taiwan
1 h-index
3 publications
3.6K citations
Dexerials (Japan)
Tokyo, Japan
1 h-index
1 publications
1.2K citations
Sony Computer Science Laboratories
Tokyo, Japan
1 h-index
2 publications
2.4K citations
Culham Centre for Fusion Energy
Abingdon, United Kingdom
1 h-index
3 publications
63 citations
Columbia University
New York, United States
1 h-index
1 publications
1.2K citations
University College Cork
Cork, Ireland
1 h-index
2 publications
42 citations
Culham Science Centre
Abingdon, United Kingdom
1 h-index
4 publications
84 citations
1–7 of 7
Venues
- Review of Scientific Instruments
1 publications · 21 citations
1
h-index
- IEEE Transactions on Image Processing
1 publications · 1.2K citations
1
h-index
- Journal of Graph Algorithms and Applications
JGAA · 1 publications · 23 citations
1
h-index
1–3