Improved bounds and algorithms for graph cuts and network reliability
From MaRDI portal
Publication:4601442
DOI10.1002/rsa.20724zbMath1378.05146OpenAlexW2747217709MaRDI QIDQ4601442
David G. Harris, Aravind Srinivasan
Publication date: 16 January 2018
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/rsa.20724
Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Connectivity (05C40)