Fully-dynamic min-cut
From MaRDI portal
Publication:5175972
DOI10.1145/380752.380804zbMath1323.68322MaRDI QIDQ5175972
Publication date: 27 February 2015
Published in: Proceedings of the thirty-third annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/380752.380804
68Q25: Analysis of algorithms and problem complexity
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
05C85: Graph algorithms (graph-theoretic aspects)
68W25: Approximation algorithms
05C40: Connectivity
Related Items
Dynamic Approximate Vertex Cover and Maximum Matching, Unnamed Item, A $\frac{4}{3}$-Approximation Algorithm for the Minimum 2-Edge Connected Multisubgraph Problem in the Half-Integral Case
Cites Work