arXiv (All)
open access
Faster Minimum k-Cut II: Near-Optimal and Deterministic for Weighted Graphs
The Minimum $k$-Cut problem asks for a minimum-weight set of edges whose removal leaves an undirected weighted graph with at least $k$ connected components. We consider only $k \ge 3$. Under the Max-Weight Clique conjecture, weighted Minimum $k$-Cut requires $n^{k-1-o(1)}$ time for every fixed $k$.
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
- Faster Minimum k-Cut I: Simple and Sparse Weighted Graphs#1064325
- Fair Division of Graphs: Beyond Traceability#799152
- Fair Division of Graphs: Beyond Traceability#797729
- An 18-colour bound for locally irregular decompositions#987111
- Locating-dominating partitions for some classes of graphs#147107
Record · ID 1064341
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