Youcef Magnouche

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
Given G = (V;E) an undirected graph and a nonnegative cost function c : E &#x2192; &#x211A;, the 2-edge connected spanning subgraph problem (TECSP for short) is to find a two-edge connected subgraph HP = (V; F) of G with minimum cost (i.e., c(F) = &#x03A3;<sub>e&#x2208;F</sub> c(e) is minimum). If c(e) &gt; 0 for all e &#x2208; E then every optimal solution(More)
In this paper we discuss a variant of the well-known k-separator problem. Given a simple graph G = (V &#x222A; T, E) with V &#x222A; T the set of vertices, where T is a set of distinguished vertices called terminals, and E a set of edges, the multi-terminal vertex separator problem consists in partitioning V &#x222A;T into k+1 subsets {S, V<sub>1</sub>,(More)
This thesis deals with the multi-terminal vertex separator problem. Given a graph G = (V ∪T,E) with V ∪T the set of vertices, where T is a set of terminals, and a weight function w : V → Z, associated with nonterminal nodes, the multi-terminal vertex separator problem consists in partitioning V ∪T into k+1 subsets {S, V1, . . . , Vk} such that there is no(More)
In this paper we discuss a variant of the well-known k-separator problem. Consider the simple graph G = (V ∪T,E) with V ∪T the set of vertices, where T is a set of distinguished vertices called terminals, inducing a stable set and E a set of edges. Given a weight function w : V → N, the multi-terminal vertex separator problem consists in finding a subset S(More)
Let G = (V ∪ T, E) be an undirected graph such that V is a set of vertices, E a set of edges and T a set of terminal vertices. The Multi-terminal vertex separator problem consists in partitioning V into k + 1 subsets {S, V1,..., Vk} minimizing the size of S and such that there is no edge between two subsets Vi and Vj and each subset Vi contains exactly one(More)
  • 1