Abstract
Given G = (V, E) a connected undirected graph and a positive integer β(|V|), the vertex separator problem is to find a partition of V into no-empty three classes A, B, C such that there is no edge between A and B, max{|A|, |B|} ≤ β(|V|) and |C| is minimum. In this paper we consider the vertex separator problem from a polyhedral point of view. We introduce new classes of valid inequalities for the associated polyhedron. Using a natural lower bound for the optimal solution, we present successful computational experiments.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Balas E., de Souza C.: The vertex separator problem: a polyhedral investigation. Math. Program. 3(103), 583–608 (2005)
Bui T.N., Jones C.: Finding good approximate vertex and edge partitions is NP-hard. Inf. Process. Lett. 42, 153–159 (1992)
Cherkassky B.V., Goldberg A.V.: On implementing Push-Relabel method for the maximum flow problem. Algorithmica 19, 390–410 (1997)
de Souza C., Balas E.: The vertex separator problem: algorithms and computations. Math. Programm. 3(103), 609–631 (2005)
Fu, B., Oprisan, S.A., Xu, L.: Multi-Directional Width-Bounded Geometric Separator and Protein Folding. ISAAC, pp. 995–1006 (2005)
Fukuyama J.: NP-completeness of the planar separator problems. J. Graph Algorithms Appl. 4, 317–328 (2006)
Garey, M.R., Johnson, D.S.: Computers and Intractabiliy. W.H. Freeman and Company (1979)
Lipton R.J., Tarjan R.E.: A separator theorem for planar graphs. SIAM J. Numer. Anal. 36, 177–189 (1979)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Didi Biha, M., Meurs, MJ. An exact algorithm for solving the vertex separator problem. J Glob Optim 49, 425–434 (2011). https://doi.org/10.1007/s10898-010-9568-y
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10898-010-9568-y