scientific article; zbMATH DE number 742961

zbMATH Open0829.68095MaRDI QIDQ4763403FDOQ4763403

Authors: Jianxiu Hao, James B. Orlin 

Publication date: 11 April 1995

Title of this publication is not available (Why is that?)

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

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)

Cited In (43)

• Two-edge connected subgraphs with bounded rings: Polyhedral results and branch-and-cut
• Separating maximally violated comb inequalities in planar graphs
• A new-old algorithm for minimum-cut and maximum-flow in closure graphs.
• On computing minimum\((s,t)\)-cuts in digraphs
• A note on optimal covering augmentation for graphic polymatroids.
• Efficient algorithms for minimum range cut problems
• On Element-Connectivity Preserving Graph Simplification
• A simple minimum \(T\)-cut algorithm
• Title not available (Why is that?)
• Title not available (Why is that?)
• A Faster Algorithm for Finding the Minimum Cut in a Directed Graph
• Binary Steiner trees: structural results and an exact solution approach
• On finding fundamental cut sets
• A distributed fault identification protocol for wireless and mobile ad hoc networks
• Vertex covering with capacitated trees
• Diagnosing infeasibilities in network flow problems
• Title not available (Why is that?)
• Implementing an efficient minimum capacity cut algorithm
• Finding k Cuts within Twice the Optimal
• Extracting maximal information about sets of minimum cuts
• A simple and fast min-cut algorithm
• Minimizing symmetric submodular functions
• Practical performance of efficient minimum cut algorithms
• Computing minimum cuts by randomized search heuristics
• Practical Minimum Cut Algorithms
• On solving cycle problems with branch-and-cut: extending shrinking and exact subcycle elimination separation algorithms
• A branch-and-cut algorithm for the nonpreemptive swapping problem
• A new unifying heuristic algorithm for the undirected minimum cut problems using minimum range cut algorithms
• An efficient algorithm for the minimum capacity cut problem
• Efficient algorithm for finding all minimal edge cuts of a nonoriented graph
• Tight approximation ratio of a general greedy splitting algorithm for the minimum \(k\)-way cut problem
• Rapidly computing robust minimum capacity s-t cuts: a case study in solving a sequence of maximum flow problems
• Title not available (Why is that?)
• The asymmetric traveling salesman problem with replenishment arcs
• Exact cuts in networks
• A correctness certificate for the Stoer-Wagner min-cut algorithm
• 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
• Title not available (Why is that?)
• A faster parametric minimum-cut algorithm
• Computing maximum mean cuts

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)