Bandwidth, Vertex Separators, and Eigenvalue Optimization

DOI10.1007/978-3-319-00200-2_14zbMath1273.90149OpenAlexW1007879714MaRDI QIDQ2849002

Mauro Piacentini, Abdel Lisser, Franz Rendl

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

zbMATH Keywords

bandwidtheigenvalue optimizationsemidefinite programmingvertex 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)

Related Items (4)

A note on the SDP relaxation of the minimum cut problem ⋮ A strictly contractive Peaceman-Rachford splitting method for the doubly nonnegative relaxation of the minimum cut problem ⋮ Eigenvalue, quadratic programming, and semidefinite programming relaxations for a cut minimization problem ⋮ Semidefinite programming and eigenvalue bounds for the graph partition problem

This page was built for publication: Bandwidth, Vertex Separators, and Eigenvalue Optimization