Linear and quadratic programming approaches for the general graph partitioning problem

Linear and quadratic programming approaches for the general graph partitioning problem

0.00 Avg rating0 Votes
Article ID: iaor20105779
Volume: 48
Issue: 1
Start Page Number: 57
End Page Number: 71
Publication Date: Sep 2010
Journal: Journal of Global Optimization
Authors: ,
Keywords: programming: linear, programming: integer, programming: quadratic
Abstract:

The graph partitioning problem is to partition the vertex set of a graph into a number of nonempty subsets so that the total weight of edges connecting distinct subsets is minimized. Previous research requires the input of cardinalities of subsets or the number of subsets for equipartition. In this paper, the problem is formulated as a zero-one quadratic programming problem without the input of cardinalities. We also present three equivalent zero-one linear integer programming reformulations. Because of its importance in data biclustering, the bipartite graph partitioning is also studied. Several new methods to determine the number of subsets and the cardinalities are presented for practical applications. In addition, hierarchy partitioning and partitioning of bipartite graphs without reordering one vertex set, are studied.

Reviews

Required fields are marked *. Your email address will not be published.