Algorithms and formulations for the minimum cut separator problem - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Electronic Notes in Discrete Mathematics Année : 2010

Algorithms and formulations for the minimum cut separator problem

Résumé

Given G=(V,E) an undirected graph and two specified nonadjacent nodes a and b of V, a cut separator is a subset F=δ(C)subset of or equal toE such that a,bset membership, variantV C and a and b belong to different connected components of the graph induced by V C. Given a nonnegative cost vector View the MathML source, cut separator of minimum cost. This new problem is closely related to the vertex separator problem. In this paper, we give a polynomial time algorithm for this problem. We also present four equivalent linear formulations, and we show their tightness. Using these results we obtain an explicit short polyhedral description of the dominant of the cut separator polytope.

Dates et versions

hal-00528560 , version 1 (22-10-2010)

Identifiants

Citer

Walid Ben-Ameur, Mohamed Didi Biha. Algorithms and formulations for the minimum cut separator problem. Electronic Notes in Discrete Mathematics, 2010, 36 (1), pp.977-983. ⟨10.1016/j.endm.2010.05.124⟩. ⟨hal-00528560⟩
81 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More