Computing All Small Cuts in an Undirected Network
From MaRDI portal
(Redirected from Publication:4377436)
Recommendations
- scientific article; zbMATH DE number 1555934
- Exact cuts in networks
- Minimum cut bases in undirected networks
- scientific article; zbMATH DE number 60387
- Computing minimum cuts in hypergraphs
- On the number of small cut in a graph
- Computing minimum multiway cuts in hypergraphs
- Blocking Small Cuts in a Network, and Related Problems
- scientific article; zbMATH DE number 1234600
Cited in
(34)- Connectivity interdiction
- Models and methods for solving the problem of network vulnerability
- Unbalanced graph cuts with minimum capacity
- Improving on best-of-many-Christofides for \(T\)-tours
- The label cut problem with respect to path length and label frequency
- Efficient Algorithms for the k Smallest Cuts Enumeration
- scientific article; zbMATH DE number 3900472 (Why is no real title available?)
- Counting almost minimum cutsets with reliability applications
- Blocking Small Cuts in a Network, and Related Problems
- scientific article; zbMATH DE number 2050721 (Why is no real title available?)
- scientific article; zbMATH DE number 1555934 (Why is no real title available?)
- scientific article; zbMATH DE number 2089977 (Why is no real title available?)
- Faster algorithms for next breakpoint and max value for parametric global minimum cuts
- A 3/2-Approximation for the Metric Many-Visits Path TSP
- Randomized contractions for multiobjective minimum cuts
- Suboptimal cuts: their enumeration, weight and number (extended abstract)
- Improving the approximation ratio for capacitated vehicle routing
- On the Parameterized Complexity of Counting Small-Sized Minimum \(\boldsymbol{(S,T)}\)-Cuts
- Improved approximation algorithms by generalizing the primal-dual method beyond uncrossable functions
- Deterministic enumeration of all minimum cut-sets and k-cut-sets in hypergraphs for fixed k
- Splitting-off in hypergraphs
- Splitting-off in hypergraphs
- An O( n)-approximation algorithm for (p, q)-flexible graph connectivity via independent rounding
- An FPTAS for connectivity interdiction
- An FPTAS for connectivity interdiction
- Protecting the connectivity of a graph under non-uniform edge failures
- Protecting the connectivity of a graph under nonuniform edge failures
- Faster algorithm for second (s,t)-mincut and breaking quadratic barrier for dual edge sensitivity for (s,t)-mincut
- Improved approximation algorithms for capacitated network design and flexible graph connectivity
- Approximation schemes for planar graph connectivity problems
- Efficient algorithms for the problems of enumerating cuts by non-decreasing weights
- A new approximation algorithm for the unbalanced min s-t cut problem
- Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs
- Complexity of the min-max (regret) versions of min cut problems
This page was built for publication: Computing All Small Cuts in an Undirected Network
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4377436)
