Algorithms and formulations for the minimum cut separator problem

MaRDI QIDQ2861519zbMATH OpenFDO

Authors Walid Ben-Ameur, Mohamed Didi Biha

Publication date 8 November 2013

Full work available at URL http://www.sciencedirect.com/science/article/pii/S1571065310001253

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• On the minimum cut separator problem
• An exact algorithm for solving the vertex separator problem
• The vertex separator problem: a polyhedral investigation
• scientific article; zbMATH DE number 1500572
• The k-separator problem: polyhedra, complexity and approximation results

Cites work

• Applications of a Planar Separator Theorem
• scientific article; zbMATH DE number 1775387 (Why is no real title available?)
• On the minimum cut separator problem
• The vertex separator problem: a polyhedral investigation

Cited in

(5)

• Extended formulations for the \(A\)-cut problem
• The vertex separator problem: a polyhedral investigation
• On the minimum cut separator problem
• Algorithms Solving the Matching Cut Problem
• An exact algorithm for solving the vertex separator problem

This page was built for publication: Algorithms and formulations for the minimum cut separator problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2861519)