Pages that link to "Item:Q5299908"
From MaRDI portal
The following pages link to On semidefinite programming bounds for graph bandwidth (Q5299908):
Displaying 6 items.
- Tabu search for the cyclic bandwidth problem (Q337475) (← links)
- Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems (Q1978696) (← links)
- Lower bounds for the bandwidth problem (Q2669517) (← links)
- On Bounding the Bandwidth of Graphs with Symmetry (Q2942684) (← links)
- (Q3974697) (← links)
- Eigenvalue, quadratic programming, and semidefinite programming relaxations for a cut minimization problem (Q5963676) (← links)