arXiv (All)
open access
The Upper Clique Transversal Problem: Hardness and Algorithms
05c7505c8568q25combinatoricscomputational-complexitydata-structures-and-algorithmsdiscrete-mathematics
A clique transversal in a graph is a set of vertices intersecting all maximal cliques. The problem of determining the minimum size of a clique transversal has received considerable attention in the literature. In this paper, we initiate the study of the ''upper'' variant of this parameter, the upper
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- W[1]-Hardness of Upper Clique Transversal#1200568
- Subquadratic-Query Algorithms for Finding Another Maximum Matroid Intersection#1011893
- Extremal Spanning Trees in Product Grid Graphs#1117479
- Scalable Algorithm for Dynamic Quasi-clique Detection#1144814
- A short review on the maximum clique problem algorithms with classical, AI, and quantum methods#376521
Record · ID 1297967
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive