Strong SDP based bounds on the cutwidth of a graph.

Elisabeth Gaar Diane Puges Angelika Wiegele

Published in: CoRR (2023)

Keyphrases

graph representation
lower bound
semidefinite programming
directed graph
graph structure
graph theory
random walk
semi definite programming
upper and lower bounds
connected components
directed acyclic graph
graph mining
graph databases
graph matching
bipartite graph
structured data
semidefinite
worst case