Spectral Graph Theory

By Daniel A. Spielman. 2012

57 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Computer Vision and Pattern Recognition, Radiology, Nuclear Medicine and Imaging

View Paper: https://www.semanticscholar.org/paper/3265e606639c89e64e5cac5e32dd3e9081b387be

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

1. Lek-Heng Lim
2. Boris N. Khoromskij
3. Liqun Qi
4. Ivan V. Oseledets
5. André Uschmajew
6. Shmuel Friedland
7. Tamara G. Kolda
8. Lieven De Lathauwer

In Computer Vision and Pattern Recognition

1. Lek-Heng Lim

In Radiology, Nuclear Medicine and Imaging

1. Lek-Heng Lim

Citations in the corpus

• Hodge Laplacians on graphs (2015, background): “In the context of graphs [21, 63], this is best seen in ∆0 — its 0-eigenpair tells us whether a graph is connected (β0(G) gives the number of connected components of G, as we saw in Section 3.”