Approche polyedrale pour le probleme du separateur (VSP)
Abstract
In an undirected connected graph G=(V,E), the vertex separator problem (VSP) asks for a partition of V into nonempty subsets A, B, C such that C is minimized such that there is no edge between A and B, and sizes of A and B are similar. This paper presents a polyhedral approach of the (VSP), introducing new efficient valid inequalities and providing computational tests and results.
 Publication:

arXiv eprints
 Pub Date:
 November 2007
 DOI:
 10.48550/arXiv.0711.3149
 arXiv:
 arXiv:0711.3149
 Bibcode:
 2007arXiv0711.3149M
 Keywords:

 Computer Science  Discrete Mathematics;
 G.2.2
 EPrint:
 21 pages, 4 figures