Biha, Mohamed Didi; Meurs, Marie-Jean - In: Journal of Global Optimization 49 (2011) 3, pp. 425-434
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...