Improved bounds and algorithms for graph cuts and network reliability

DOI10.1002/RSA.20724MaRDI QIDQ4601442zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

graph cutscontraction algorithmgraph reliability

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40) Approximation algorithms (68W25) Connectivity (05C40)

Recommendations

• Improved bounds and algorithms for graph cuts and network reliability
• Counting almost minimum cutsets with reliability applications
• scientific article; zbMATH DE number 1263176
• A Randomized Fully Polynomial Time Approximation Scheme for the All-Terminal Network Reliability Problem
• A randomized fully polynomial time approximation scheme for the all-terminal network reliability problem

Cited in

(5)

• Approximating \(k\)-cuts using network strength as a Lagrangean relaxation
• Counting almost minimum cutsets with reliability applications
• scientific article; zbMATH DE number 975420 (Why is no real title available?)
• scientific article; zbMATH DE number 795107 (Why is no real title available?)
• Improved bounds and algorithms for graph cuts and network reliability

This page was built for publication: Improved bounds and algorithms for graph cuts and network reliability

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