Weighted min-cut: sequential, cut-query, and streaming algorithms
From MaRDI portal
Publication:5144937
DOI10.1145/3357713.3384334OpenAlexW2983782154MaRDI QIDQ5144937
Danupon Nanongkai, Sagnik Mukhopadhyay
Publication date: 19 January 2021
Published in: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1911.01651
Related Items (2)
Faster connectivity in low-rank hypergraphs via expander decomposition ⋮ Vector-Matrix-Vector Queries for Solving Linear Algebra, Statistics, and Graph Problems
This page was built for publication: Weighted min-cut: sequential, cut-query, and streaming algorithms