Embedded in the shadow of the separator

SIAM Journal on Optimization

Volumn 19, Issue 1, 2008, Pages 472-501

  Göring, Frank ^a   Helmberg, Christoph ^a   Wappler, Markus ^a  

^a CHEMNITZ UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

Eigenvalue optimization; Embedding, graph partitioning; Semidefinite programming; Spectral graph theory; Tree width

Indexed keywords

DEMODULATION; EIGENVALUES AND EIGENFUNCTIONS; GRAPH THEORY; LIGHT; LIGHT SOURCES; ONTOLOGY; OPTIMIZATION; SEPARATION; SEPARATORS;

EIGENVALUE OPTIMIZATION; EMBEDDING, GRAPH PARTITIONING; SEMIDEFINITE PROGRAMMING; SPECTRAL GRAPH THEORY; TREE WIDTH;

TREES (MATHEMATICS);

EID: 61349089256     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/050639430     Document Type: Article

References (29)

1. K. L. BOYER AND K. SENGUPTA, Modelbase partitioning using property matrix spectra, Computer Vision and Image Understanding, 70 (1998), pp. 177-196.
2. T. F. CHAN, P. CIARLET, JR., AND W. K. SZETO, On the optimality of the median cut spectral bisection graph partitioning method, SIAM J. Sci. Comput., 18 (1997), pp. 943-948.
3. D. CVETKOVIĆ, M. DOOB, AND H. SACHS, Spectra of Graphs. Theory and Application, 3rd ed., J. A. Barth Verlag, Leipzig, 1995.
4. E. DE KLERK, C. ROOS, AND T. TERLAKY, Initialization in semidefinite programming via a self-dual skew-symmetric embedding, Oper. Res. Lett., 20 (1997), pp. 213-221.
5. R. DIESTEL, Graph Theory, 2nd ed., Springer, Berlin, 2000.
6. M. FIEDLER, Algebraic connectivity of graphs, Czechoslovak Math. J., 23 (1973), pp. 298-305.
7. M. FIEDLER, Laplacian of graphs and algebraic connectivity, Combin. Graph Theory, 25 (1989), pp. 57-70.
8. M. FIEDLER, Absolute algebraic connectivity of trees, Linear Multilinear Algebra, 26 (1990), pp. 85-106.
9. M. FIEDLER, A Geometric Approach to the Laplacian Matrix of a Graph, IMA Vol. Math. Appl. 50, Springer, New York, 1993, pp. 73-98.
10. M. FIEDLER, Some minimax problems for graphs, Discrete Math., 121 (1993), pp. 65-74.
11. C. HELMBERG, B. MOHAR, S. POLJAK, AND F. RENDL, A spectral approach to bandwidth and separator problems in graphs, Linear Multilinear Algebra, 39 (1995), pp. 73-90.
12. X. JI AND H. ZHA, Extracting Shared Topics of Multiple Documents, Lect. Notes Comput. Sci. 2637, Springer, Berlin, 2003, pp. 100-110.
13. M. JUVAN AND B. MOHAR, Laplace eigenvalues and bandwidth-type invariants of graphs, J. Graph Theory, 17 (1993), pp. 393-407.
14. A. KAVEH AND H. A. RAHIMI BONDARABADY, Bisection for parallel computing using Ritz and Fiedler vectors, Acta Mech., 167 (2004), pp. 131-144.
15. J. KEUCHEL, C. SCHNÖRR, C. SCHELLEWALD, AND D. CREMERS, Binary partitioning, perceptual grouping, and restoration with semidefinite programming, IEEE Trans. Pattern Analysis and Machine Intelligence, 25 (2003), pp. 1364-1379.
16. L. LOVÁSZ, On the Shannon capacity of a graph, IEEE Trans. Inform. Theory, IT-25 (1979), pp. 1-7.
17. B. MOHAR, The Laplacian spectrum of graphs, in Graph Theory, Combinatorics, and Applications, John Wiley and Sons, New York, 1991, pp. 871-898.
18. B. MOHAR, Graph Laplacians, in Topics in Algebraic Graph Theory, Encyclopedia Math. Appl. 102, Beineke et al., eds., Cambridge University Press, London, 2004, pp. 113-136.
19. B. MOHAR AND S. POLJAK, Eigenvalues in combinatorial optimization, in Combinatorial and Graph Theoretic Problems in Linear Algebra, IMA Vol. Math. Appl. Vol. 50, R. Brualdi, S. Friedland, and V. Klee, eds., Springer, New York, 1993.
20. A. POTHEN, H. D. SIMON, AND K. LIOU, Partitioning sparse matrices with eigenvectors of graphs, SIAM J. Matrix Anal. Appl., 11 (1990), pp. 430-452.
21. H. D. SIMON. A. SOHN, AND R. BISWAS, Harp: A dynamic spectral partitioner, J. Parallel and Distributed Computing, 50 (1998), pp. 83-103.
22. A. MAN-CHO SO, Y. YE, AND J. ZHANG, A unified theorem on SDP rank reduction, Math. Oper. Res., to appear.
23. J. F. STURM, Using SeDuMi 1.02, A MATLAB Toolbox for Optimization over Symmetric Cones (updated for version 1.05,), manual, Department of Econometrics, Tilburg University, P.O. Box 90153, 5000 LE Tilburg, The Netherlands, 2001.
24. J. SUN, S. BOYD, L. XIAO, AND P. DIACONIS, The fastest mixing Markov process on a graph and a connection to a maximum variance unfolding problem, SIAM Rev., 48 (2006), pp. 681-699.
25. H. VAN DER HOLST, L. LOVÁSZ, AND A. SCHRIJVER, The Colin de Verdière graph parameter, in Graph Theory and Combinatorial Biology, Bolyai Soc. Math. Stud. 7, Lovász et al., ed., eds., Bolyai Mathematical Society, Budapest, 1999, pp. 29-85.
26. K. Q. WEINBERGER AND L. K. SAUL, Unsupervised learning of image manifolds by semidefinite programming, Internat. J. Comput. Vision, 70 (2006), pp. 77-90.
27. K. Q. WEINBERGER, F. SHA, AND L. K. SAUL, Learning a kernel matrix for nonlinear dimensionality reduction, in Proceedings of the Twenty-First International Conference on Machine Learning (ICML-04), Banff, Canada, ACM, New York, 2004, pp. 839-846.
28. H. WOLKOWICZ, R. SAIGAL, AND L. VANDENBERGHE, EDS., Handbook of Semidefinite Programming, Internat. Ser. Oper. Res. Management Sci. 27, Kluwer Academic Publishers, Boston/Dordrecht/London, 2000.
29. C. W. WU, On Rayleigh-Ritz ratios of a generalized Laplacian matrix of directed graphs, Linear Algebra Appl., 402 (2005), pp. 207-227.