# Computing Clique Cover with Structural Parameterization

arXiv: https://arxiv.org/abs/2208.12438 · HTML: https://mlsanity.com/paper/2208.12438/

## Key facts

- Cited by 2 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 26 Aug 2022.

## Built on by (most cited first, 2 of 2)

- [Neuro-Causal Factor Analysis](https://mlsanity.com/paper/2305.19802/) (2023)
- [W2SAT: Learning to generate SAT instances from Weighted Literal Incidence Graphs](https://mlsanity.com/paper/2302.00272/) (2023)

## Abstract (arXiv)

An abundance of real-world problems manifest as covering edges and/or vertices of a graph with cliques that are optimized for some objectives. We consider different structural parameters of graph, and design fixed-parameter tractable algorithms for a number of clique cover problems. Using a set representation of graph, we introduce a framework for computing clique cover with different objectives. We demonstrate use of the framework for a variety of clique cover problems. Our results include a number of new algorithms with exponential to double exponential improvements in the running time.