Laplacian eigenvalues and fixed size multisection
暂无分享,去创建一个
[1] A. Hoffman,et al. Lower bounds for the partitioning of graphs , 1973 .
[2] B. Mohar. Some applications of Laplace eigenvalues of graphs , 1997 .
[3] Charles Delorme,et al. Laplacian eigenvalues and the maximum cut problem , 1993, Math. Program..
[4] László Lovász,et al. On the Shannon capacity of a graph , 1979, IEEE Trans. Inf. Theory.
[5] Alan M. Frieze,et al. Improved approximation algorithms for MAXk-CUT and MAX BISECTION , 1995, Algorithmica.
[6] Michael Doob,et al. Spectra of graphs , 1980 .
[7] Charles R. Johnson,et al. Topics in Matrix Analysis , 1991 .
[8] David R. Karger,et al. Approximate graph coloring by semidefinite programming , 1998, JACM.
[9] G. H. Hardy,et al. The Maximum of a Certain Bilinear Form , 1926 .