A simple min-cut algorithm
From MaRDI portal
Recommendations
Cited in
(92)- Minimizing symmetric submodular functions
- Inverse maximum capacity problems
- A simple minimum \(T\)-cut algorithm
- A note on the minimization of symmetric and general submodular functions
- Weight reduction problems with certain bottleneck objectives.
- Cardinality constrained minimum cut problems: complexity and algorithms.
- A correctness certificate for the Stoer-Wagner min-cut algorithm
- Decomposition-by-normalization (DBN): leveraging approximate functional dependencies for efficient CP and Tucker decompositions
- A comparison of algorithms for finding an efficient theme park tour
- On graphs of the cone decompositions for the min-cut and max-cut problems
- Connectivity interdiction
- Topological optimization of reliable networks under dependent failures
- Computing minimum multiway cuts in hypergraphs
- Parametric analysis of overall min-cuts and applications in undirected networks.
- Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested
- Models and methods for solving the problem of network vulnerability
- Graph clustering, variational image segmentation methods and Hough transform scale detection for object measurement in images
- An FPT algorithm for matching cut and d-cut
- Decision-based scenario clustering for decision-making under uncertainty
- Cuts in undirected graphs. I
- Finding densest \(k\)-connected subgraphs
- A fast algorithm for cactus representations of minimum cuts
- Computing vertex-disjoint paths in large graphs using MAOs
- Symmetric submodular system: contractions and Gomory-Hu tree
- I/O efficient algorithms for the minimum cut problem on unweighted undirected graphs
- Parameterized algorithms for min-max multiway cut and list digraph homomorphism
- Divide-and-conquer algorithms for partitioning hypergraphs and submodular systems
- The prize-collecting generalized minimum spanning tree problem
- A min-cut approach to functional regionalization, with a case study of the Italian local labour market areas
- A simple and fast min-cut algorithm
- New algorithms for a simple measure of network partitioning
- A new-old algorithm for minimum-cut and maximum-flow in closure graphs.
- Diffuse interface models on graphs for classification of high dimensional data
- On the complexity of computing the \(k\)-restricted edge-connectivity of a graph
- Minimum cuts and shortest cycles in directed planar graphs via noncrossing shortest paths
- scientific article; zbMATH DE number 437525 (Why is no real title available?)
- Constrained and bicriteria inverse bottleneck optimization problems under weighted Hamming distance
- Approximating spectral clustering via sampling: a review
- LP relaxation and tree packing for minimum k-cut
- Time constrained maximal covering salesman problem with weighted demands and partial coverage
- Minimum Cuts of Simple Graphs in Almost Always Linear Time
- Partitioning planar graphs: a fast combinatorial approach for max-cut
- A combinatorial model and algorithm for globally searching community structure in complex networks
- Hearing the clusters of a graph: A distributed algorithm
- Minimum cuts and sparsification in hypergraphs
- Constrained graph partitioning via matrix differential equations
- Practical minimum cut algorithms
- On minimum 3-cuts and approximating k-cuts using cut trees
- Certifying algorithms
- A decomposition algorithm for the ring spur assignment problem
- Efficient and Adaptive Parameterized Algorithms on Modular Decompositions
- On the complexity of computing the \(k\)-restricted edge-connectivity of a graph
- Faster algorithms for next breakpoint and max value for parametric global minimum cuts
- Fast and deterministic approximations for \(k\)-cut
- Computing vertex-disjoint paths in large graphs using MAOs
- Data Analytics on Graphs Part I: Graphs and Spectra on Graphs
- Data Analytics on Graphs Part III: Machine Learning on Graphs, from Graph Topology to Applications
- Computing area-optimal simple polygonizations
- The Complexity of Boolean Surjective General-Valued CSPs
- Randomized contractions for multiobjective minimum cuts
- Local flow partitioning for faster edge connectivity
- A branch-price-and-cut algorithm for packing cuts in undirected graphs
- Cache oblivious minimum cut
- A branch-and-cut algorithm for the ring spur assignment problem
- Exact algorithms for cluster editing: Evaluation and experiments
- Fundamentals of Computation Theory
- Hypergraph k-Cut for Fixed k in Deterministic Polynomial Time
- Fast and Deterministic Approximations for k-Cut.
- Minimum Cuts in Surface Graphs
- Polynomial-time algorithms for multimarginal optimal transport problems with structure
- scientific article; zbMATH DE number 7759280 (Why is no real title available?)
- An optimal pruned traversal tree-based fast minimum cut solver in dense graph
- Minimum Cut and Minimum k -Cut in Hypergraphs via Branching Contractions
- On the edge-connectivity and restricted edge-connectivity of optimal 1-planar graphs
- Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations
- New algorithms for a simple measure of network partitioning
- Generalized cut trees for edge-connectivity
- Hybridizing evolutionary algorithms with variable-depth search to overcome local optima
- Max-flow min-cut theorem in quantum computing
- Consistent community detection approach in the nonparametric weighted stochastic blockmodel with unspecified number of communities
- Deterministic minimum cut in poly-logarithmic maximum flows
- High-speed minimum cut approximation in dense graph using compacted pruned tree
- On supervalid inequalities for binary interdiction games
- Graph connectivity and its augmentation: Applications of MA orderings
- Minimum s-t hypercut in (s, t)-planar hypergraphs
- Isolating cuts, (bi-)submodularity, and faster algorithms for connectivity
- A hybrid mathematical framework for morphogenesis and regeneration
- Finding minimum 3-way cuts in hypergraphs
- Minimum degree orderings
- Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs
- An efficient algorithm for the minimum capacity cut problem
- Complexity of the min-max (regret) versions of min cut problems
This page was built for publication: A simple min-cut algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4377588)
