Approche polyedrale pour le probleme du separateur (VSP)
| dc.creator | Meurs, Marie-Jean | |
| dc.date | 2007-11-20 | |
| dc.date.accessioned | 2026-07-07T08:44:00Z | |
| dc.date.available | 2026-07-07T08:44:00Z | |
| dc.description | 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. | |
| dc.description | 21 pages, 4 figures | |
| dc.identifier | https://arxiv.org/abs/0711.3149 | |
| dc.identifier | http://arxiv.org/abs/0711.3149 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/142512 | |
| dc.subject | Discrete Mathematics | |
| dc.subject | G.2.2 | |
| dc.title | Approche polyedrale pour le probleme du separateur (VSP) | |
| dc.type | text |