The k-separator problem - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès COCOON '13 : 19th International Computing & Combinatorics Conference Année : 2013

The k-separator problem

Résumé

Given a vertex-weighted undirected graph G = (V, E,w) and a positive integer k, we consider the k-separator problem: it consists in finding a minimum-weight subset of vertices whose removal leads to a graph where the size of each connected component is less than or equal to k. We show that this problem can be solved in polynomial time for some graph classes: for cycles and trees by a dynamic programming approach and by using a peculiar graph transformation coupled with recent results from the literature for mK2-free, (G1,G2, G3, P6)-free, interval-filament, asteroidal triple-free, weakly chordal, interval and circular-arc graphs. Approximation algorithms are also presented.

Dates et versions

hal-00843860 , version 1 (12-07-2013)

Identifiants

Citer

Walid Ben-Ameur, Mohamed Ahmed Mohamed Sidi, José Neto. The k-separator problem. COCOON '13 : 19th International Computing & Combinatorics Conference, Jun 2013, Hangzhou, China. pp.337-348, ⟨10.1007/978-3-642-38768-5_31⟩. ⟨hal-00843860⟩
147 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More