Blocking Small Cuts in a Network, and Related Problems

DOI10.1137/0222034MaRDI QIDQ4202207zbMATH OpenOpenAlexFDO

Authors Daniel Bienstock, Nicole Diaz

Publication date 1 September 1993

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0222034

zbMATH Keywords

connectivitylinear timeNP-hard

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Computing All Small Cuts in an Undirected Network
• The Complexity of Multiterminal Cuts
• On the k-cut subgraph polytope
• scientific article; zbMATH DE number 1555934
• A Polynomial Algorithm for the k-cut Problem for Fixed k

Cited in

(5)

• A constrained minimum cost s-t cutset problem
• Computing All Small Cuts in an Undirected Network
• Logical s-t Min-Cut Problem: An Extension to the Classic s-t Min-Cut Problem
• Protecting the connectivity of a graph under non-uniform edge failures
• Protecting the connectivity of a graph under nonuniform edge failures

This page was built for publication: Blocking Small Cuts in a Network, and Related Problems

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