Deterministic near-linear time minimum cut in weighted graphs

DOI10.1137/1.9781611977912.111MaRDI QIDQ6645473zbMATH OpenFDO

Authors Monika R. Henzinger, Jason Li, Satish Rao, Di Wang

Publication date 28 November 2024

Full work available at URL https://doi.org/10.1137/1.9781611977912.111

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(6)

• Minimum cut in \(O(m \log^2 n)\) time
• Bisection width, discrepancy, and eigenvalues of hypergraphs
• Deterministic minimum cut in poly-logarithmic maximum flows
• Worst-case to expander-case reductions: derandomized and generalized
• Deterministic minimum Steiner cut in maximum flow time
• Deterministic k-median clustering in near-optimal time

This page was built for publication: Deterministic near-linear time minimum cut in weighted graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6645473)