The vertex separator problem: a polyhedral investigation
From MaRDI portal
Publication:2487852
Recommendations
- An exact algorithm for solving the vertex separator problem
- The vertex separator problem: algorithms and computations
- The multi-terminal vertex separator problem: polyhedral analysis and branch-and-cut
- On the minimum cut separator problem
- Algorithms and formulations for the minimum cut separator problem
Cites work
- A Separator Theorem for Planar Graphs
- Applications of a Planar Separator Theorem
- Finding Separator Cuts in Planar Graphs within Twice the Optimal
- Geometric Separators for Finite-Element Meshes
- scientific article; zbMATH DE number 5542185 (Why is no real title available?)
- scientific article; zbMATH DE number 3176062 (Why is no real title available?)
- Parallel Algorithms for Sparse Linear Systems
- Partitioning planar graphs with vertex costs: Algorithms and applications
- The vertex separator problem: algorithms and computations
Cited in
(39)- Separating from the dominant of the spanning tree polytope
- A quality and distance guided hybrid algorithm for the vertex separator problem
- The multi-terminal vertex separator problem: polyhedral analysis and branch-and-cut
- The critical node detection problem in networks: a survey
- A hybrid breakout local search and reinforcement learning approach to the vertex separator problem
- A branch-and-price algorithm for capacitated hypergraph vertex separation
- On integer and bilevel formulations for the \(k\)-vertex cut problem
- A compact mixed integer linear formulation for safe set problems
- A polynomial-time algorithm for finding critical nodes in bipartite permutation graphs
- The k-separator problem: polyhedra, complexity and approximation results
- Polynomial time efficient construction heuristics for vertex separation minimization problem
- The vertex \(k\)-cut problem
- Optimizing over the split closure
- The vertex separator problem: algorithms and computations
- Continuous quadratic programming formulations of optimization problems on graphs
- On the problem polyhedral separability: a numerical solution
- The multi-terminal vertex separator problem: polytope characterization and TDI-ness
- Algorithms and formulations for the minimum cut separator problem
- On the minimum cut separator problem
- Exact algorithms for the vertex separator problem in graphs
- Knowledge discovery in graphs through vertex separation
- Combining intensification and diversification strategies in VNS. An application to the vertex separation problem
- Lagrangian Relaxation and Cutting Planes for the Vertex Separator Problem
- On the vertex separation of maximal outerplanar graphs
- An I/O-Efficient Algorithm for Computing Vertex Separators on Multi-Dimensional Grid Graphs and Its Applications
- Casting Light on the Hidden Bilevel Combinatorial Structure of the Capacitated Vertex Separator Problem
- Disconnecting graphs by removing vertices: a polyhedral approach
- A Separation Algorithm for b-Matching Degree-Sequence Polyhedra
- A new lower bound on the size of the smallest vertex separator of a graph
- Linear ordering based MIP formulations for the vertex separation or pathwidth problem
- Linear ordering based MIP formulations for the vertex separation or pathwidth problem
- An exact algorithm for solving the vertex separator problem
- Integer programming models and polyhedral study for the geodesic classification problem on graphs
- The MIN-cut and vertex separator problem
- A multilevel bilinear programming algorithm for the vertex separator problem
- The multi-terminal vertex separator problem: total dual integrality and polytope composition
- A graph multi-separator problem for image segmentation
- The multi-terminal vertex separator problem: branch-and-cut-and-price
- Approximating polyhedra with sparse inequalities
This page was built for publication: The vertex separator problem: a polyhedral investigation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2487852)
