Embedded in the Shadow of the Separator

DOI10.1137/050639430MaRDI QIDQ3608992zbMATH OpenOpenAlexFDO

Authors Frank Göring, Christoph Helmberg, Markus Wappler

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

zbMATH Keywords

spectral graph theorysemidefinite programmingembeddingeigenvalue optimizationgraph partitioningtree width

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Programming involving graphs or networks (90C35) Semidefinite programming (90C22) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• Shadowing in a neighbourhood of a separatrix
• Shadowing in a neighborhood of a separatrix
• Splitting the shadow.
• A new dimension hidden in the shadow of a wall
• scientific article; zbMATH DE number 3280965
• On the consistency of a separator
• Between umbra and penumbra
• Sub-shadowings

Cited in

(19)

• A note on Fiedler value of classes with sublinear separators
• Finding graph embeddings by incremental low-rank semidefinite programming
• Conformally rigid graphs
• Connectedness of users-items networks and recommender systems
• A note on Fiedler vectors interpreted as graph realizations
• Embedding and the rotational dimension of a graph containing a clique
• The rotational dimension of a graph
• Comparison of metric spectral gaps
• A new dimension hidden in the shadow of a wall
• Embedding and the first Laplace eigenvalue of a finite graph
• Consensus control for linear systems with optimal energy cost
• On minimizing the spectral width of graph Laplacians and associated graph realizations
• Absolute algebraic connectivity of double brooms and trees
• Combinatorial algorithms for minimizing the maximum Laplacian and signless Laplacian eigenvalues of weighted graphs
• Spectral representations of vertex transitive graphs, Archimedean solids and finite Coxeter groups
• Maximization of the first Laplace eigenvalue of a finite graph
• A new graph parameter related to bounded rank positive semidefinite matrix completions
• Graph realizations associated with minimizing the maximum eigenvalue of the Laplacian
• Projected primal-dual gradient flow of augmented Lagrangian with application to distributed maximization of the algebraic connectivity of a network

Describes a project that uses

Uses Software

• SeDuMi

This page was built for publication: Embedded in the Shadow of the Separator

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3608992)