DeepAI AI Chat
Log In Sign Up

Subnetwork Constraints for Tighter Upper Bounds and Exact Solution of the Clique Partitioning Problem

by   Alexander Belyi, et al.
NYU college

We consider a variant of the clustering problem for a complete weighted graph. The aim is to partition the nodes into clusters maximizing the sum of the edge weights within the clusters. This problem is known as the clique partitioning problem, being NP-hard in the general case of having edge weights of different signs. We propose a new method of estimating an upper bound of the objective function that we combine with the classical branch-and-bound technique to find the exact solution. We evaluate our approach on a broad range of random graphs and real-world networks. The proposed approach provided tighter upper bounds and achieved significant convergence speed improvements compared to known alternative methods.


page 1

page 2

page 3

page 4


A Maximum Edge-Weight Clique Extraction Algorithm Based on Branch-and-Bound

The maximum edge-weight clique problem is to find a clique whose sum of ...

Partitioning the Bags of a Tree Decomposition Into Cliques

We consider a variant of treewidth that we call clique-partitioned treew...

A tight bound for the clique query problem in two rounds

We consider a problem introduced by Feige, Gamarnik, Neeman, Rácz and Te...

Relaxed Graph Color Bound for the Maximum k-plex Problem

As a relaxation of the clique, a k-plex of a graph is a vertex set that ...

Bound Propagation

In this article we present an algorithm to compute bounds on the margina...

An iterative step-function estimator for graphons

Exchangeable graphs arise via a sampling procedure from measurable funct...

Consensus Division in an Arbitrary Ratio

We consider the problem of partitioning a line segment into two subsets,...

Code Repositories


Algorithms to find optimal partitions by maximizing modularity in community detection and solving clique partitioning problem.

view repo