arXiv (All)
open access
Kernelization of 2-Club Cluster Edge Deletion on Interval Graphs
The \emph{$s$-Club Cluster Edge Deletion} problem asks whether, given a graph $G$ and an integer $k$, one can delete at most $k$ edges so that every remaining connected component has diameter at most~$s$. This generalizes the classical \emph{Cluster Edge Deletion} problem by permitting components of
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
- Improved polynomial-time algorithms for detecting and recovering planted $Θ(\sqrt{n})$-cliques#1051182
- Sample Complexity of Correlation Detection in Erdős-Rényi graphs#821772
- ClusterGraph: a new tool for visualisation and compression of multidimensional data.#362329
- Impartial removing games on grid graphs#1084015
- Search and clustering orders of magnitude faster than BLAST#6361
Record · ID 821011
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