scientific article; zbMATH DE number 742961
From MaRDI portal
Publication:4763403
Recommendations
Cited in
(51)- A note on finding minimum cuts in directed planar networks by parallel computations
- Extracting maximal information about sets of minimum cuts
- Diagnosing infeasibilities in network flow problems
- Minimizing symmetric submodular functions
- The line index and minimum cut of weighted graphs
- A new saling algorithm for the maximum mean cut problem
- A faster parametric minimum-cut algorithm
- Computing maximum mean cuts
- Minimum cut problem using bases of extended polymatroids
- A simple minimum \(T\)-cut algorithm
- The asymmetric traveling salesman problem with replenishment arcs
- A note on optimal covering augmentation for graphic polymatroids.
- A correctness certificate for the Stoer-Wagner min-cut algorithm
- Binary Steiner trees: structural results and an exact solution approach
- Implementing an efficient minimum capacity cut algorithm
- A new unifying heuristic algorithm for the undirected minimum cut problems using minimum range cut algorithms
- Practical performance of efficient minimum cut algorithms
- On solving cycle problems with branch-and-cut: extending shrinking and exact subcycle elimination separation algorithms
- A fast algorithm for cactus representations of minimum cuts
- Two-edge connected subgraphs with bounded rings: Polyhedral results and branch-and-cut
- A simple and fast min-cut algorithm
- A new-old algorithm for minimum-cut and maximum-flow in closure graphs.
- A branch-and-cut algorithm for the preemptive swapping problem
- Efficient algorithm for finding all minimal edge cuts of a nonoriented graph
- Algebraic methods for stochastic minimum cut and maximum flow problems
- On element-connectivity preserving graph simplification
- scientific article; zbMATH DE number 3900472 (Why is no real title available?)
- scientific article; zbMATH DE number 4068647 (Why is no real title available?)
- Exact cuts in networks
- scientific article; zbMATH DE number 177540 (Why is no real title available?)
- scientific article; zbMATH DE number 1256719 (Why is no real title available?)
- Efficient algorithms for minimum range cut problems
- A Faster Algorithm for Finding the Minimum Cut in a Directed Graph
- Finding k Cuts within Twice the Optimal
- A distributed fault identification protocol for wireless and mobile ad hoc networks
- A new approach to the minimum cut problem
- A simple min-cut algorithm
- scientific article; zbMATH DE number 2075842 (Why is no real title available?)
- Practical minimum cut algorithms
- Separating maximally violated comb inequalities in planar graphs
- scientific article; zbMATH DE number 3999696 (Why is no real title available?)
- A branch-and-cut algorithm for the nonpreemptive swapping problem
- Finding robust minimum cuts
- Rapidly computing robust minimum capacity s-t cuts: a case study in solving a sequence of maximum flow problems
- Vertex covering with capacitated trees
- Computing minimum cuts by randomized search heuristics
- Tight approximation ratio of a general greedy splitting algorithm for the minimum \(k\)-way cut problem
- Deterministic minimum cut in poly-logarithmic maximum flows
- On computing minimum(s,t)-cuts in digraphs
- An efficient algorithm for the minimum capacity cut problem
- On finding fundamental cut sets
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4763403)
