arXiv (All)
open access
Near-optimal edge partitioning via intersecting families
We study the problem of edge partitioning, where the goal is to partition the edge set of a graph into $k$ parts. The replication factor of a vertex $v$ is the number of parts that contain edges incident to $v$. The goal is to minimize the average replication factor of the vertices while keeping the
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
- Locating-dominating partitions for some classes of graphs#147107
- Faster Minimum k-Cut I: Simple and Sparse Weighted Graphs#1064325
- Extremal problems for cancellative and locally thin hypergraphs#986484
- Distributed $(Δ+1)$-Coloring in Graphs of Bounded Neighborhood Independence#924468
- Distributed $(Δ+1)$-Coloring in Graphs of Bounded Neighborhood Independence#920237
Record · ID 1141416
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