Showing 1 - 10 of 59
We derive a new lower bound for the bandwidth of a graph that is based on a new lower bound for the min-cut problem. Our new semidefinite programming relaxation of the min-cut problem is obtained by strengthening the known semidefinite programming relaxation for the quadratic assignment problem...
Persistent link: https://www.econbiz.de/10011144425
Persistent link: https://www.econbiz.de/10011087256
Persistent link: https://www.econbiz.de/10011087270
Persistent link: https://www.econbiz.de/10011087305
Persistent link: https://www.econbiz.de/10011087346
Persistent link: https://www.econbiz.de/10011087373
Persistent link: https://www.econbiz.de/10011087383
Persistent link: https://www.econbiz.de/10011087558
Persistent link: https://www.econbiz.de/10011087561
Persistent link: https://www.econbiz.de/10011087604