Streaming max-cut requires Ω(n) space for dense graphs but Ω(n log(ε² n)/ε²) space for graphs with Θ(n/ε²) edges when outputting the cut, with matching upper bounds for dense case and similar separations for densest subgraph.
Title resolution pending
4 Pith papers cite this work, alongside 37 external citations. Polarity classification is still indexing.
4
Pith papers citing it
37
external citations · Crossref
representative citing papers
A cover-and-conquer algorithm approximates the densest P-partite subgraph to a (1-δ)/(1+η) factor using polylogarithmically many weight representatives, yielding the first PTAS for meta-paths of length i>2.
For three QUBO reformulations of the sparsest k-subgraph problem, exactness conditions for penalty parameters are proved, and iterative simulated-annealing and D-Wave algorithms are evaluated.
Hybrid GBS with classical post-processing for DkSP achieves near-optimal solutions and ~4X sampling efficiency gains on community graphs while outperforming pure post-selection on sparse graphs.
citing papers explorer
-
Towards a Hybrid Quantum Enhanced Solution for Densest k-Subgraph Problem
Hybrid GBS with classical post-processing for DkSP achieves near-optimal solutions and ~4X sampling efficiency gains on community graphs while outperforming pure post-selection on sparse graphs.