scientific article; zbMATH DE number 437525
From MaRDI portal
Publication:3140397
Recommendations
Cited in
(49)- NP-hard and linear variants of hypergraph partitioning
- A new unifying heuristic algorithm for the undirected minimum cut problems using minimum range cut algorithms
- Equivalence classes and conditional hardness in massively parallel computations
- Fast augmenting paths by random sampling from residual graphs
- Faster algorithms for next breakpoint and max value for parametric global minimum cuts
- A branch-and-cut algorithm for the vehicle routing problem with two-dimensional loading constraints
- Multicriteria Cuts and Size-Constrained k-Cuts in Hypergraphs.
- Complexity of the min-max (regret) versions of min cut problems
- Contracting a planar graph efficiently
- Maker-Breaker games on randomly perturbed graphs
- A new probabilistic analysis of Karger's randomized algorithm for minimum cut problems
- A new contraction technique with applications to congruency-constrained cuts
- A branch-and-cut algorithm for the soft-clustered vehicle-routing problem
- Using a Min-Cut generalisation to go beyond Boolean surjective VCSPs
- Randomized approximation schemes for cuts and flows in capacitated graphs
- Randomized contractions for multiobjective minimum cuts
- A correctness certificate for the Stoer-Wagner min-cut algorithm
- A polynomial bound on the number of light cycles in an undirected graph
- Deterministic enumeration of all minimum cut-sets and \(k\)-cut-sets in hypergraphs for fixed \(k\)
- Minimum cut in \(O(m \log^2 n)\) time
- A general framework for graph sparsification
- Logical s-t Min-Cut Problem: An Extension to the Classic s-t Min-Cut Problem
- The Complexity of Boolean Surjective General-Valued CSPs
- Derandomization through approximation, an NC algorithm for minimum cuts
- Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs
- Recent developments in maximum flow algorithms
- Isolating a vertex via lattices: polytopes with totally unimodular faces
- Uniform-circuit and logarithmic-space approximations of refined combinatorial optimization problems
- Efficient algorithms for minimum range cut problems
- Dual averaging with adaptive random projection for solving evolving distributed optimization problems
- Community detection in feature-rich networks using data recovery approach
- Optimal cuts in graphs and statistical mechanics
- Most balanced minimum cuts
- A 3/2-Approximation for the Metric Many-Visits Path TSP
- Algorithms for the ferromagnetic Potts model on expanders
- Computing exact minimum cuts without knowing the graph
- A simpler minimum spanning tree verification algorithm
- scientific article; zbMATH DE number 177555 (Why is no real title available?)
- Multicriteria cuts and size-constrained \(k\)-cuts in hypergraphs
- Isolating a vertex via lattices: polytopes with totally unimodular faces
- Social pressure in opinion dynamics
- Computing girth and cogirth in perturbed graphic matroids
- Minimum Cut and Minimum k -Cut in Hypergraphs via Branching Contractions
- Faster cut sparsification of weighted graphs
- On the number of circuits in regular matroids (with connections to lattices and codes)
- Average Sensitivity of Graph Algorithms
- Faster connectivity in low-rank hypergraphs via expander decomposition
- Community detection in node-attributed social networks: a survey
- Hypergraph k-Cut for Fixed k in Deterministic Polynomial Time
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 Q3140397)
