scientific article; zbMATH DE number 2166873

MaRDI QIDQ4674154zbMATH OpenFDO

Authors Franz Rendl, Janez Povh

Publication date 9 May 2005

zbMATH Keywords

bandwidth problemrelaxationsemidefinite programming

Mathematics Subject Classification ID

Semidefinite programming (90C22)

Recommendations

• On semidefinite programming bounds for graph bandwidth
• Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems
• Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems
• On bounding the bandwidth of graphs with symmetry
• Lower bounds for the bandwidth problem

Cited in

(5)

• Immediate schedule adjustment and semidefinite relaxation
• On bounding the bandwidth of graphs with symmetry
• scientific article; zbMATH DE number 6714114 (Why is no real title available?)
• Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems
• On semidefinite programming bounds for graph bandwidth

This page was built for publication:

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