On Minimizing the Spectral Width of Graph Laplacians and Associated Graph Realizations

DOI10.1137/110859658zbMath1272.05113OpenAlexW2013749552MaRDI QIDQ2848176

Christoph Helmberg, Susanna Reiss, Frank Göring

Publication date: 25 September 2013

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/77557aa4784981a87ff8b1bc529f66a7cec53b2c

zbMATH Keywords

embeddingeigenvalue optimizationsemidefinite programmingspectral graph theorytree-width

Mathematics Subject Classification ID

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