Pages that link to "Item:Q2942684"
From MaRDI portal
The following pages link to On Bounding the Bandwidth of Graphs with Symmetry (Q2942684):
Displaying 6 items.
- The MIN-cut and vertex separator problem (Q683339) (← links)
- Semidefinite programming and eigenvalue bounds for the graph partition problem (Q2349129) (← links)
- On the bandwidth of the Kneser graph (Q2357135) (← links)
- Lower bounds for the bandwidth problem (Q2669517) (← links)
- \(L_p\)-norm regularization algorithms for optimization over permutation matrices (Q2832890) (← links)
- On semidefinite programming bounds for graph bandwidth (Q5299908) (← links)