186 citations · 405 across the 30 of their papers we have counts for
Showing math.OCShow all
3 papers · 1 filter
math.OC2015★ 18 cited
New bounds for the max--cut and chromatic number of a graph
Edwin R. van Dam, Renata Sotirov
We consider several semidefinite programming relaxations for the max--cut problem, with increasing complexity. The optimal solution of the weakest presented semidefinite program…
math.OC2013★ 11 cited
Semidefinite programming and eigenvalue bounds for the graph partition problem
Edwin R. van Dam, Renata Sotirov
The graph partition problem is the problem of partitioning the vertex set of a graph into a fixed number of sets of given sizes such that the sum of weights of edges joining differ…
math.OC2012★ 8 cited
On bounding the bandwidth of graphs with symmetry
Edwin R. van Dam, Renata Sotirov
We derive a new lower bound for the bandwidth of a graph that is based on a new lower bound for the minimum cut problem. Our new semidefinite programming relaxation of the minimum…