Deterministic minimum Steiner cut in maximum flow time

DOI10.4230/LIPICS.ESA.2024.46MaRDI QIDQ7253103zbMATH OpenFDO

Authors Jason Li

Publication date 26 May 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.ESA.2024.46

zbMATH Keywords

deterministicgraph algorithmsminimum cut

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• A deterministic almost-linear time algorithm for minimum-cost flow
• Deterministic Edge Connectivity in Near-Linear Time
• Deterministic min-cut in poly-logarithmic max-flows
• Deterministic mincut in almost-linear time
• Deterministic near-linear time minimum cut in weighted graphs
• Graph partitioning using single commodity flows
• scientific article; zbMATH DE number 795214 (Why is no real title available?)
• Local flow partitioning for faster edge connectivity

Cited in

(1)

• Near-optimal vertex fault-tolerant labels for Steiner connectivity

This page was built for publication: Deterministic minimum Steiner cut in maximum flow time

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