arXiv (All)
open access
Parameterized Complexity of Edge-Constrained Graph Partitioning
We study the Edge-Constrained Graph Partitioning Problem (ECGP), which asks whether the vertices of a graph can be partitioned into r parts, each inducing at least gamma edges. We also consider a balanced variant (BECGP), requiring equal-sized parts, and signed variants, where the utility of a part
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
- Parameterized Complexity of Edge-Constrained Graph Partitioning#789007
- An empirical study of various candidate selection and partitioning techniques in the DIRECT framework#986060
- Solution Space Partitioning for Extremal Set Theory#1083157
- Generalized Graph Search Trees#985960
- Reconstructing graphs with subgraph compositions#156429
Record · ID 793011
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