Strong SDP based bounds on the cutwidth of a graph
From MaRDI portal
Publication:6065655
DOI10.1016/j.cor.2023.106449arXiv2301.03900MaRDI QIDQ6065655
Elisabeth Gaar, Diane Puges, Angelika Wiegele
Publication date: 15 November 2023
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2301.03900
Cites Work
- Unnamed Item
- On the hyperbolicity of bipartite graphs and intersection graphs
- Branch and bound for the cutwidth minimization problem
- Semidefinite relaxations of ordering problems
- A note on exact algorithms for vertex ordering problems on graphs
- Antibandwidth and cyclic antibandwidth of meshes and hypercubes
- Graphs with small bandwidth and cutwidth
- Cutwidth: obstructions and algorithmic aspects
- Tree-width, path-width, and cutwidth
- Tailored heuristics in adaptive large neighborhood search applied to the cutwidth minimization problem
- An SDP-based approach for computing the stability number of a graph
- A computational study of exact subgraph based SDP bounds for max-cut, stable set and coloring
- A bundle approach for SDPs with exact subgraph constraints
- New exact approaches to row layout problems
- A branch and bound algorithm for the matrix bandwidth minimization
- An experimental comparison of four graph drawing algorithms.
- Lower bounds for the bandwidth problem
- Exact Algorithms for the Quadratic Linear Ordering Problem
- Cutwidth of Split Graphs and Threshold Graphs
- Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
- The space of closed subgroups of ℝnis stratified and simply connected
- A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
- A polynomial algorithm for the min-cut linear arrangement of trees
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Cutwidth of the de Bruijn graph
- Computational Experience with Stable Set Relaxations
- Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time
- Partitioning through projections: strong SDP bounds for large graph partition problems
- A Hierarchy of Subgraph Projection-Based Semidefinite Relaxations for Some NP-Hard Graph Optimization Problems
