arXiv (All)
open access
Sparsification Framework for Directed Densest Subgraph
We develop a new approach for computing approximate directed densest subgraphs (DDS). Our main result is a sparsification procedure that reduces a directed graph $G$ on $n$ vertices to a graph with $n \cdot \text{poly} \log n$ edges while preserving enough structure to recover an approximate DDS of
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
- Bounded Independence Edge Subsampling in Graphs#347579
- Exponential Lower Bounds for Integer-Weighted Shortest-Paths Preservers of DAGs#1000175
- Locating-dominating partitions for some classes of graphs#147107
- Faster Minimum k-Cut I: Simple and Sparse Weighted Graphs#1064325
- Filter Learning for Subgraphs: Algebras and Performance Risk Bounds#394421
Record · ID 1155781
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