DeepAI AI Chat
Log In Sign Up

Fixed-Parameter Tractability of the Weighted Edge Clique Partition Problem

by   Andreas Emil Feldmann, et al.

We develop an FPT algorithm and a kernel for the Weighted Edge Clique Partition (WECP) problem, where a graph with n vertices and integer edge weights is given together with an integer k, and the aim is to find k cliques, such that every edge appears in exactly as many cliques as its weight. The problem has been previously only studied in the unweighted version called Edge Clique Partition (ECP), where the edges need to be partitioned into k cliques. It was shown that ECP admits a kernel with k^2 vertices [Mujuni and Rosamond, 2008], but this kernel does not extend to WECP. The previously fastest algorithm known for ECP had a runtime of 2^O(k^2)n^O(1) [Issac, 2019]. For WECP we develop a bi-kernel with 4^k vertices, and an algorithm with runtime 2^O(k^3/2w^1/2log(k/w))n^O(1), where w is the maximum edge weight. The latter in particular improves the runtime for ECP to 2^O(k^3/2log k)n^O(1). We also show that our algorithm necessarily needs a runtime of 2^Θ(k^3/2log k)n^O(1) to solve ECP.


page 1

page 2

page 3

page 4


Kernel for Kt-free edge deletion

In the K_t-free edge deletion problem, the input is a graph G and an int...

Parameterized algorithms for identifying gene co-expression modules via weighted clique decomposition

We present a new combinatorial model for identifying regulatory modules ...

Faster Decomposition of Weighted Graphs into Cliques using Fisher's Inequality

Mining groups of genes that consistently co-express is an important prob...

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 ...

On the Hardness of Compressing Weights

We investigate computational problems involving large weights through th...

Optimal Intervention on Weighted Networks via Edge Centrality

Suppose there is a spreading process such as an infectious disease propa...

Stochastic Runtime Analysis of a Cross Entropy Algorithm for Traveling Salesman Problems

This article analyzes the stochastic runtime of a Cross-Entropy Algorith...