The vertex separator problem: a polyhedral investigation
From MaRDI portal
Publication:2487852
DOI10.1007/s10107-005-0574-7zbMath1099.90065MaRDI QIDQ2487852
Egon Balas, Cid Carvalho De Souza
Publication date: 8 August 2005
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-005-0574-7
90C35: Programming involving graphs or networks
90C11: Mixed integer programming
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
Related Items
Disconnecting graphs by removing vertices: a polyhedral approach, An exact algorithm for solving the vertex separator problem, Optimizing over the split closure, The vertex separator problem: algorithms and computations, On the minimum cut separator problem, Exact algorithms for the vertex separator problem in graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Partitioning planar graphs with vertex costs: Algorithms and applications
- The vertex separator problem: algorithms and computations
- A Separator Theorem for Planar Graphs
- Applications of a Planar Separator Theorem
- Parallel Algorithms for Sparse Linear Systems
- Finding Separator Cuts in Planar Graphs within Twice the Optimal
- Geometric Separators for Finite-Element Meshes