arXiv (All)
open access
On the Parameterized Complexity of $s$-Club Cluster Edge Deletion
We study the parameterized and kernelization complexity of the \emph{\textsc{$s$-Club Cluster Edge Deletion}} problem, a distance-bounded generalization of \emph{\textsc{Cluster Edge Deletion}}. Given a graph $G=(V,E)$ and integers $k,s$, the goal is to delete at most $k$ edges so that every resulti
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
- On the Parameterized Complexity of $s$-Club Cluster Edge Deletion#789490
- Faster Minimum k-Cut II: Near-Optimal and Deterministic for Weighted Graphs#1064341
- Computing the Helly Number, Radon Number and Rank in Cycle Convexity#1119309
- Sample Complexity of Correlation Detection in Erdős-Rényi graphs#821772
- Near-optimal edge partitioning via intersecting families#1141416
Record · ID 793494
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