arXiv (All)
open access
Query Complexity of Densest Sub(hyper)graph Problems
Rubinstein et al. introduce the study of connectivity and minimum cut problems in the cut query model, where an algorithm can only access the edges of a graph through CUT queries. In this work, we examine the query complexity of densest subgraph problems. Our first contribution is to generalize 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
- Extremal problems for cancellative and locally thin hypergraphs#986484
- Streaming Hypergraph Coloring via Palette Sparsification#1013660
- Maximum Strong Independent Sets in Hypergraphs: Reductions, Bounds, and Greedy Certificates#1011663
- From Mixing to Tearing: Graph Decomposition in Decentralized Optimization via Message Passing#1188420
- From Mixing to Tearing: Graph Decomposition in Decentralized Optimization via Message Passing#1181622
Record · ID 1342795
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