scientific article; zbMATH DE number 742961

MaRDI QIDQ4763403zbMATH OpenFDO

Authors Jianxiu Hao, James B. Orlin

Publication date 11 April 1995

zbMATH Keywords

minimum cutmaximum flow problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• A Faster Algorithm for Finding the Minimum Cut in a Directed Graph
• Implementing an efficient minimum capacity cut algorithm
• A new approach to the minimum cut problem
• Minimum cuts in near-linear time
• Fundamentals of Computation Theory

Cited in

(45)

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

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)