Embedded in the Shadow of the Separator
From MaRDI portal
Publication:3608992
DOI10.1137/050639430zbMath1169.05347MaRDI QIDQ3608992
Frank Göring, Markus Wappler, Christoph Helmberg
Publication date: 6 March 2009
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/b5b18682e0535a8d420d2869d765ea242fe967ba
embedding; eigenvalue optimization; semidefinite programming; graph partitioning; tree width; spectral graph theory
90C35: Programming involving graphs or networks
90C22: Semidefinite programming
05C10: Planar graphs; geometric and topological aspects of graph theory
05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)
05C78: Graph labelling (graceful graphs, bandwidth, etc.)
Related Items
Combinatorial Algorithms for Minimizing the Maximum Laplacian and Signless Laplacian Eigenvalues of Weighted Graphs, Comparison of Metric Spectral Gaps, Embedding and the rotational dimension of a graph containing a clique, Connectedness of users-items networks and recommender systems, Spectral representations of vertex transitive graphs, Archimedean solids and finite Coxeter groups, Graph realizations associated with minimizing the maximum eigenvalue of the Laplacian, Absolute algebraic connectivity of double brooms and trees, A note on Fiedler vectors interpreted as graph realizations, Projected primal-dual gradient flow of augmented Lagrangian with application to distributed maximization of the algebraic connectivity of a network, Consensus control for linear systems with optimal energy cost, A new graph parameter related to bounded rank positive semidefinite matrix completions, The rotational dimension of a graph, Finding graph embeddings by incremental low-rank semidefinite programming
Uses Software
