A Framework for Computing Greedy Clique Cover
Data Structures and Algorithms
2022-09-07 v2 Discrete Mathematics
Abstract
Structural parameters of graph (such as degeneracy and arboricity) had rarely been considered when designing algorithms for problems. Taking degeneracy of graph into account, we present a greedy framework and two fixed-parameter tractable algorithms for problems. We introduce a set theoretic concept and demonstrate its use in the computations of different objectives of . Furthermore, we show efficacy of our algorithms in practice.
Cite
@article{arxiv.2108.09851,
title = {A Framework for Computing Greedy Clique Cover},
author = {Ahammed Ullah},
journal= {arXiv preprint arXiv:2108.09851},
year = {2022}
}
Comments
28 Pages, 6 Figures