Year: 2022
Type: preprint
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.
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: W4293567953