arXiv (All)
open access
Graph Partitioning with Demands: Generalized Conductance and its Applications
We study various graph partitioning tasks subject to general demands. In Graph Partitioning with Demands (GPD), the goal is to delete minimum cost supply edge set so that each remaining component contains at most a prescribed fraction of the total demand. In the hierarchical analogue of this problem
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
- Multi-tier Flexible Graph Connectivity#792326
- Multi-tier Flexible Graph Connectivity#788326
- Parameterized Complexity of Edge-Constrained Graph Partitioning#793011
- Parameterized Complexity of Edge-Constrained Graph Partitioning#789007
- Partitioning perfect graphs into comparability graphs#1247244
Record · ID 1399917
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