Approche polyedrale pour le probleme du separateur (VSP)

Details Approche polyedrale pour le probleme du separateur (VSP) Approche polyedrale pour le probleme du separateur (VSP)

2007-11-20

arxiv.org/abs/0711.3149v1

Computer Science

Discrete Mathematics

21 pages, 4 figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Approche polyedrale pour le probleme du separateur (VSP) does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Approche polyedrale pour le probleme du separateur (VSP), we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Approche polyedrale pour le probleme du separateur (VSP) will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-391991