Add to ORKGWe study various polynomial special cases for the problem of partitioning a vertex-weighted undirected graph into p connected subgraphs with minimum gap between the largest and the smallest vertex weight
AbstractMany vertex-partitioning problems can be expressed within a general framework introduced by ...
Given a graph G = (V,E) with nonnegative weights x(e) for each edge e, a partition inequality is of ...
We study the problem of decomposing the vertex set V of a graphinto two parts (V1, V2) which induce ...
We study various polynomial special cases for the problem of partitioning a vertex-weighted undirect...
We study the computational complexity and approximability for the problem of partitioning a vertex-w...
We study various polynomial special cases for the problem of partitioning a vertex-weighted undirect...
The Minimum Gap Graph Partitioning Problem (MGGPP) consists in partitioning a vertex-weighted undire...
Graph partitioning is a widely studied problem in the literature with several applications in real ...
We address the min-sum version of the Minimum Gap Graph Partitioning Problem through a Tabu Search m...
AbstractAssume that each vertex of a graph G is assigned a nonnegative integer weight and that l and...
Let G = (N; E) be an edge-weighted undirected graph. The graph partitioning problem is the problem o...
Assume that each vertex of a graph G is assigned a nonnegative integer weight and that l and u are g...
AbstractMany vertex-partitioning problems can be expressed within a general framework introduced by ...
Given a graph G = (V,E) with nonnegative weights x(e) for each edge e, a partition inequality is of ...
We study the problem of decomposing the vertex set V of a graphinto two parts (V1, V2) which induce ...
We study various polynomial special cases for the problem of partitioning a vertex-weighted undirect...
We study the computational complexity and approximability for the problem of partitioning a vertex-w...
We study various polynomial special cases for the problem of partitioning a vertex-weighted undirect...
The Minimum Gap Graph Partitioning Problem (MGGPP) consists in partitioning a vertex-weighted undire...
Graph partitioning is a widely studied problem in the literature with several applications in real ...
We address the min-sum version of the Minimum Gap Graph Partitioning Problem through a Tabu Search m...
AbstractAssume that each vertex of a graph G is assigned a nonnegative integer weight and that l and...
Let G = (N; E) be an edge-weighted undirected graph. The graph partitioning problem is the problem o...
Assume that each vertex of a graph G is assigned a nonnegative integer weight and that l and u are g...
AbstractMany vertex-partitioning problems can be expressed within a general framework introduced by ...
Given a graph G = (V,E) with nonnegative weights x(e) for each edge e, a partition inequality is of ...
We study the problem of decomposing the vertex set V of a graphinto two parts (V1, V2) which induce ...