ppt课件-c s267 graph partitioning- e e c sat u c berkeley（c s267图分区- e e c u c伯克利坐下）.pptVIP

03/09/2009 CS267 Lecture 13 * References Details of all proofs on Jim Demmel’s 267 web page A. Pothen, H. Simon, K.-P. Liou, “Partitioning sparse matrices with eigenvectors of graphs”, SIAM J. Mat. Anal. Appl. 11:430-452 (1990) M. Fiedler, “Algebraic Connectivity of Graphs”, Czech. Math. J., 23:298-305 (1973) M. Fiedler, Czech. Math. J., 25:619-637 (1975) B. Parlett, “The Symmetric Eigenproblem”, Prentice-Hall, 1980 /~ruhe/lantplht/lantplht.html /laso 03/109/2009 CS267 Lecture 13 * Summary Partitioning with nodal coordinates: Inertial method Projection onto a sphere Algorithms are efficient R