Improved bounds and algorithms for graph cuts and network reliability

DOI10.1137/1.9781611973402.19zbMath1421.68134arXiv1602.08730MaRDI QIDQ5383978

Aravind Srinivasan, David G. Harris

Publication date: 20 June 2019

Published in: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1602.08730

Mathematics Subject Classification ID

68W40: Analysis of algorithms

68R10: Graph theory (including graph drawing) in computer science

05C85: Graph algorithms (graph-theoretic aspects)

68W25: Approximation algorithms

05C40: Connectivity