AbstractWe consider the graphs Han defined as the Cartesian products of n complete graphs with a vertices each. Let an edge cut partition the vertex set of a graph into k subsets A1,…,Ak with ||Ai|−|Aj||⩽1. We consider the problem of determining the minimal size of such a cut for the graphs defined above and present bounds and asymptotic results for some specific values of k
We give a combinatorial algorithm to find a maximum packing of hypertrees in a capacitated hypergrap...
Abstract Two kinds of approximation algorithms exist for the k-BAL-ANCED PARTITIONING problem: those...
A complete partition of a graph G is a partition of its vertex set in which any two distinct classes...
AbstractWe consider the graphs Han defined as the Cartesian products of n complete graphs with a ver...
. Let an edge cut partition the vertex set of the n-cube into k subsets A1 ; :::; Ak with jjA i j \...
. Let an edge cut partition the vertex set of the n-cube into k subsets A1 ; :::; Ak with jjA i j \...
We study the problem of finding the minimum number of edges that, when cut, form a partition of the ...
Let an edge cut partition the vertex set of an n-dimensional quadratic grid with the side length a i...
Graph partitioning is the problem of splitting a graph into two or more partitions of fixed sizes wh...
We study graph partitioning problems from a min-max perspective, in which an input graph on $n$ vert...
In this project, we have studied and worked on results and algorithms centered around (global) minim...
AbstractA graph with n vertices and minimum degree k⩾2 can contain no more than (2k−2)n(k2−2) cut ve...
We study graph partitioning problems from a min-max perspective, in which an input graph on n vertic...
AbstractJudicious partition problems ask for partitions of the vertex set of graphs so that several ...
Abstract. We study graph partitioning problems from a min-max perspective, in which an input graph o...
We give a combinatorial algorithm to find a maximum packing of hypertrees in a capacitated hypergrap...
Abstract Two kinds of approximation algorithms exist for the k-BAL-ANCED PARTITIONING problem: those...
A complete partition of a graph G is a partition of its vertex set in which any two distinct classes...
AbstractWe consider the graphs Han defined as the Cartesian products of n complete graphs with a ver...
. Let an edge cut partition the vertex set of the n-cube into k subsets A1 ; :::; Ak with jjA i j \...
. Let an edge cut partition the vertex set of the n-cube into k subsets A1 ; :::; Ak with jjA i j \...
We study the problem of finding the minimum number of edges that, when cut, form a partition of the ...
Let an edge cut partition the vertex set of an n-dimensional quadratic grid with the side length a i...
Graph partitioning is the problem of splitting a graph into two or more partitions of fixed sizes wh...
We study graph partitioning problems from a min-max perspective, in which an input graph on $n$ vert...
In this project, we have studied and worked on results and algorithms centered around (global) minim...
AbstractA graph with n vertices and minimum degree k⩾2 can contain no more than (2k−2)n(k2−2) cut ve...
We study graph partitioning problems from a min-max perspective, in which an input graph on n vertic...
AbstractJudicious partition problems ask for partitions of the vertex set of graphs so that several ...
Abstract. We study graph partitioning problems from a min-max perspective, in which an input graph o...
We give a combinatorial algorithm to find a maximum packing of hypertrees in a capacitated hypergrap...
Abstract Two kinds of approximation algorithms exist for the k-BAL-ANCED PARTITIONING problem: those...
A complete partition of a graph G is a partition of its vertex set in which any two distinct classes...
DOI
Add to ORKG