Nothing Special   »   [go: up one dir, main page]
Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Computer Science > Data Structures and Algorithms

arXiv:2108.09851 (cs)
[Submitted on 22 Aug 2021 (v1), last revised 2 Sep 2022 (this version, v2)]

Title:A Framework for Computing Greedy Clique Cover

Authors:Ahammed Ullah
View PDF
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.
Comments: 28 Pages, 6 Figures
Subjects: Data Structures and Algorithms (cs.DS); Discrete Mathematics (cs.DM)
ACM classes: F.2.2; G.2.1; G.2.2
Cite as: arXiv:2108.09851 [cs.DS]
  (or arXiv:2108.09851v2 [cs.DS] for this version)
  https://doi.org/10.48550/arXiv.2108.09851

Submission history

From: Ahammed Ullah [view email]
[v1] Sun, 22 Aug 2021 21:20:54 UTC (54 KB)
[v2] Fri, 2 Sep 2022 21:51:14 UTC (50 KB)
Full-text links:

Access Paper:

license icon view license
Current browse context:
cs.DS
< prev   |   next >
new | recent | 2021-08
Change to browse by:
cs
cs.DM

References & Citations

DBLP - CS Bibliography

listing | bibtex
export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)