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