Strong SDP based bounds on the cutwidth of a graph.
Elisabeth GaarDiane PugesAngelika WiegelePublished in: Comput. Oper. Res. (2024)
Keyphrases
- random walk
- lower bound
- upper bound
- graph representation
- graph model
- graph theory
- semidefinite programming
- graph theoretic
- graph structure
- graph mining
- connected components
- directed graph
- lower and upper bounds
- semi definite programming
- constant factor
- upper and lower bounds
- undirected graph
- bipartite graph
- graph matching
- error bounds
- structured data
- worst case
- high dimensional