2000 character limit reached
Approche polyedrale pour le probleme du separateur (VSP)
Published 20 Nov 2007 in cs.DM | (0711.3149v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.