Strong SDP based bounds o
Strong SDP based bounds on the cutwidth of a graph
Strong SDP based bounds on the cutwidth of a graph
arXiv:2301.03900v4 Announce Type: replace-cross
Abstract: Given a linear ordering of the vertices of a graph, the cutwidth of a vertex $v$ with respect to this ordering is the number of edges from any vertex before $v$ (including $v$) to any vertex after $v$ in this ordering. The cutwidth of an ord…
