A simple semi-streaming algorithm for global minimum cuts

DOI10.1137/1.9781611976496.19MaRDI QIDQ6538756zbMATH OpenFDO

Authors Sepehr Assadi, Aditi Dudeja

Publication date 14 May 2024

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

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(9)

• Polynomial pass semi-streaming lower bounds for k-cores and degeneracy
• Streaming edge coloring with asymptotically optimal colors
• Streaming algorithms for connectivity augmentation
• (+1) vertex coloring in O(n) communication
• ( + 1) vertex coloring in O(n) communication
• A (3+)-approximate correlation clustering algorithm in dynamic streams
• Matrix hypercontractivity, streaming algorithms and LDCs: the large alphabet case
• Almost optimal superconstant-pass streaming lower bounds for reachability
• Streaming algorithms for network design

This page was built for publication: A simple semi-streaming algorithm for global minimum cuts

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