An Efficient Heuristic Procedure for Partitioning Graphs
We consider the problem of partitioning the nodes of a graph with costs on its edges into subsets of given sizes so as to minimize the sum of the costs on all edges cut. This pr...
We consider the problem of partitioning the nodes of a graph with costs on its edges into subsets of given sizes so as to minimize the sum of the costs on all edges cut. This pr...
h-index: Number of publications with at least h citations each.