Bandwidth, vertex separators, and eigenvalue optimization

DOI10.1007/978-3-319-00200-2_14zbMATH Open1273.90149OpenAlexW1007879714MaRDI QIDQ2849002FDOQ2849002

Authors: Franz Rendl, Abdel Lisser, M. Piacentini 

Publication date: 13 September 2013

Published in: Discrete Geometry and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-00200-2_14

Recommendations

• A spectral approach to bandwidth and separator problems in graphs
• scientific article; zbMATH DE number 1263269
• scientific article; zbMATH DE number 510844
• Lower bounds for the bandwidth problem
• Partitioning Sparse Matrices with Eigenvectors of Graphs

zbMATH Keywords

bandwidthsemidefinite programmingeigenvalue optimizationvertex separator

Mathematics Subject Classification ID

Applications of graph theory (05C90) Semidefinite programming (90C22) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cited In (8)

• Lower bounds for the bandwidth problem
• Eigenvalue, quadratic programming, and semidefinite programming relaxations for a cut minimization problem
• A strictly contractive Peaceman-Rachford splitting method for the doubly nonnegative relaxation of the minimum cut problem
• Visualization and Bandwidth Matrix Choice
• A spectral approach to bandwidth and separator problems in graphs
• GRASP and path relinking for the matrix bandwidth minimization.
• A note on the SDP relaxation of the minimum cut problem
• Semidefinite programming and eigenvalue bounds for the graph partition problem

This page was built for publication: Bandwidth, vertex separators, and eigenvalue optimization

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