Publisher
Springer Science and Business Media LLC
Reference62 articles.
1. Shi, J., Malik, J.: Normalized cuts and image segmentation. IEEE Trans. Pattern Anal. Mach. Intell. 22(8), 888–905 (2000)
2. Cheeger, J.: A lower bound for the smallest eigenvalue of the Laplacian. In: Problems in Analysis, pp. 195–200. Princeton University Press (2015)
3. Donath, W.E., Hoffman, A.J.: Algorithms for partitioning of graphs and computer logic based on eigenvectors of connection matrices. IBM Tech. Discl. Bull. 15(3), 938–944 (1972)
4. Fiedler, M.: Algebraic connectivity of graphs. Czechoslov. Math. J. 23(2), 298–305 (1973)
5. Guattery, S., Miller, G.L.: On the performance of spectral graph partitioning methods. Technical report, Carnegie-Mellon Univ Pittsburgh PA Department of Computer Science (1994)