Pages that link to "Item:Q4853927"
From MaRDI portal
The following pages link to A spectral approach to bandwidth and separator problems in graphs (Q4853927):
Displaying 17 items.
- Semidefinite relaxations of ordering problems (Q359627) (← links)
- Semidefinite approximations for quadratic programs over orthogonal matrices (Q609564) (← links)
- Continuation methods for approximate large scale object sequencing (Q669313) (← links)
- The MIN-cut and vertex separator problem (Q683339) (← links)
- On a conjecture of Brouwer involving the connectivity of strongly regular graphs (Q765871) (← links)
- Copositive and semidefinite relaxations of the quadratic assignment problem (Q834180) (← links)
- Bounds on special subsets in graphs, eigenvalues and association schemes (Q1386530) (← links)
- Spectral methods for graph bisection problems. (Q1406654) (← links)
- Lower bounds for the quadratic assignment problem via triangle decompositions (Q1914071) (← links)
- The toughness of Kneser graphs (Q2037560) (← links)
- On the bandwidth of the Kneser graph (Q2357135) (← links)
- Lower bounds for the bandwidth problem (Q2669517) (← links)
- SDP Relaxations for Some Combinatorial Optimization Problems (Q2802546) (← links)
- Matrix Relaxations in Combinatorial Optimization (Q2897308) (← links)
- On semidefinite programming bounds for graph bandwidth (Q5299908) (← links)
- Facial reduction for symmetry reduced semidefinite and doubly nonnegative programs (Q6044986) (← links)
- A preconditioned iterative interior point approach to the conic bundle subproblem (Q6126660) (← links)