The MIN-cut and vertex separator problem
From MaRDI portal
Recommendations
- Eigenvalue, quadratic programming, and semidefinite programming relaxations for a cut minimization problem
- A Copositive Programming Approach to Graph Partitioning
- An exact algorithm for solving the vertex separator problem
- The vertex separator problem: a polyhedral investigation
- Graph bisection revisited
Cites work
- scientific article; zbMATH DE number 4070633 (Why is no real title available?)
- scientific article; zbMATH DE number 3783337 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3335677 (Why is no real title available?)
- A Copositive Programming Approach to Graph Partitioning
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- A Separator Theorem for Planar Graphs
- A computational study of graph partitioning
- A framework for solving VLSI graph layout problems
- A multilevel bilinear programming algorithm for the vertex separator problem
- A new bound for the quadratic assignment problem based on convex quadratic programming
- A projection technique for partitioning the nodes of a graph
- A spectral approach to bandwidth and separator problems in graphs
- An Efficient Heuristic Procedure for Partitioning Graphs
- An exact algorithm for solving the vertex separator problem
- Applications of a Planar Separator Theorem
- Continuous quadratic programming formulations of optimization problems on graphs
- Dual estimates in multiextremal problems
- Eigenvalue, quadratic programming, and semidefinite programming relaxations for a cut minimization problem
- Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem
- Generalized Nested Dissection
- Geometric Separators for Finite-Element Meshes
- Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method
- LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison
- Lower Bounds for the Partitioning of Graphs
- MULTI-DIRECTIONAL WIDTH-BOUNDED GEOMETRIC SEPARATOR AND PROTEIN FOLDING
- On Lagrangian relaxation of quadratic matrix constraints
- On bounding the bandwidth of graphs with symmetry
- On semidefinite programming relaxations of maximum \(k\)-section
- Partial Lagrangian relaxation for general quadratic programming
- SDP relaxations in combinatorial optimization from a Lagrangian viewpoint.
- Semidefinite programming relaxations for the graph partitioning problem
- Semidefinite programming relaxations for the quadratic assignment problem
- Solving large quadratic assignment problems on computational grids
- Solving semidefinite-quadratic-linear programs using SDPT3
- The Boolean quadratic polytope: Some characteristics, facets and relatives
- The RPR2 rounding technique for semidefinite programs
- The vertex separator problem: a polyhedral investigation
- The vertex separator problem: algorithms and computations
Cited in
(17)- The complexity of the vertex-minor problem
- Facial reduction for symmetry reduced semidefinite and doubly nonnegative programs
- Continuous quadratic programming formulations of optimization problems on graphs
- A new lower bound on the size of the smallest vertex separator of a graph
- A note on the SDP relaxation of the minimum cut problem
- Lower bounds for the bandwidth problem
- A strictly contractive Peaceman-Rachford splitting method for the doubly nonnegative relaxation of the minimum cut problem
- scientific article; zbMATH DE number 1783770 (Why is no real title available?)
- Graph bisection revisited
- Lagrangian Relaxation and Cutting Planes for the Vertex Separator Problem
- A multilevel bilinear programming algorithm for the vertex separator problem
- Eigenvalue, quadratic programming, and semidefinite programming relaxations for a cut minimization problem
- The Maximum k-Colorable Subgraph Problem and Related Problems
- The vertex separator problem: algorithms and computations
- scientific article; zbMATH DE number 1333614 (Why is no real title available?)
- Two new integer linear programming formulations for the vertex bisection problem
- Partitioning through projections: strong SDP bounds for large graph partition problems
This page was built for publication: The MIN-cut and vertex separator problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q683339)
