Computing Clique Cover with Structural Parameterization
Data Structures and Algorithms
2022-08-29 v1 Discrete Mathematics
Abstract
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.
Cite
@article{arxiv.2208.12438,
title = {Computing Clique Cover with Structural Parameterization},
author = {Ahammed Ullah},
journal= {arXiv preprint arXiv:2208.12438},
year = {2022}
}
Comments
38 pages, 12 figures