DeepAI
Log In Sign Up

Clique Cover of Graphs with Bounded Degeneracy

08/22/2021
by   Ahammed Ullah, et al.
0

Structural parameters of graph (such as degeneracy and arboricity) had rarely been considered when designing algorithms for (edge) clique cover problems. Taking degeneracy of graph into account, we present a greedy framework and two fixed-parameter tractable algorithms for clique cover problems. We introduce a set theoretic concept and demonstrate its use in the computations of different objectives of clique cover. Furthermore, we show efficacy of our algorithms in practice.

READ FULL TEXT

page 1

page 2

page 3

page 4

08/26/2022

Computing Clique Cover with Structural Parameterization

An abundance of real-world problems manifest as covering edges and/or ve...
09/13/2019

Enumerating Isolated Cliques in Temporal Networks

Isolation has been shown to be a valuable concept in the world of clique...
09/27/2017

Diversified Coherent Core Search on Multi-Layer Graphs

Mining dense subgraphs on multi-layer graphs is an interesting problem, ...
11/21/2017

Revisiting Connected Vertex Cover: FPT Algorithms and Lossy Kernels

The CONNECTED VERTEX COVER problem asks for a vertex cover in a graph th...
05/07/2020

Imbalance Parameterized by Twin Cover Revisited

We study the problem of Imbalance parameterized by the twin cover of a g...
07/03/2019

Solving Partial Assignment Problems using Random Clique Complexes

We present an alternate formulation of the partial assignment problem as...
06/01/2021

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

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