First EPTAS for ConstrainedMinCut, MinQuotientCut and ProductSparsestCut on everywhere-δ-dense graphs via weak regularity lemma and sampling.
Existence and explicit constructions of q+ 1 regular ramanujan graphs for every prime power q
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
EPTAS for Hard Graph Cut Problems for Dense Graphs
First EPTAS for ConstrainedMinCut, MinQuotientCut and ProductSparsestCut on everywhere-δ-dense graphs via weak regularity lemma and sampling.