Year: 2021
Type: preprint
Abstract: Structural parameters of graph (such as degeneracy and arboricity) had rarely been considered when designing algorithms for $\textit{(edge) clique cover}$ problems. Taking degeneracy of graph into account, we present a greedy framework and two fixed-parameter tractable algorithms for $\textit{clique cover}$ problems. We introduce a set theoretic concept and demonstrate its use in the computations of different objectives of $\textit{clique cover}$. Furthermore, we show efficacy of our algorithms in practice.
Source: arXiv (Cornell University)
Author: Ullah, Ahammed
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W4297630220